Articles on Trending Technologies

Technical articles with clear explanations and examples

Print Single and Multiple variables in Java

AmitDiwan
AmitDiwan
Updated on 11-Mar-2026 3K+ Views

To print single and multiple variables in Java, the code is as follows −Examplepublic class Demo {    public static void main(String args[]){       String name_1 = "Hello";       String name_2 = "World";       System.out.println("Printing single variable");       System.out.printf("%s", name_1);       System.out.println("Printing multiple variables");       System.out.printf("First Name: %sLast Name: %s",name_1, name_2);    } }OutputPrinting single variable Hello Printing multiple variables First Name: Hello Last Name: WorldA class named Demo contains the main function, which defines two strings. These strings are displayed using the ‘println’ function and using the ‘printf’ function.

Read More

Find a non empty subset in an array of N integers such that sum of elements of subset is divisible by N in C++

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 447 Views

Suppose we have an array of n numbers; we have to find a non-empty subset such that the sum of elements of the subset is divisible by n. So, we have to output any such subset with its size and the indices of elements in the original array when it is present.So, if the input is like [3, 2, 7, 1, 9], then the output will be [2], [1 2].To solve this, we will follow these steps −Define one map my_mapadd := 0for initialize i := 0, when i < N, update (increase i by 1), do −add := (add ...

Read More

Java program to split the Even and Odd elements into two different lists

AmitDiwan
AmitDiwan
Updated on 11-Mar-2026 938 Views

To split the Even and Odd elements into two different lists, the Java code is as follows −Exampleimport java.util.Scanner; public class Demo{    public static void main(String[] args){       int n, j = 0, k = 0;       Scanner s = new Scanner(System.in);       System.out.println("Enter the number of elements required :");       n = s.nextInt();       int my_arr[] = new int[n];       int odd_vals[] = new int[n];       int even_vals[] = new int[n];       System.out.println("Enter the elements of the array(even and add numbers) :"); ...

Read More

Find a number which give minimum sum when XOR with every number of array of integer in C++

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 372 Views

ConceptWith respect of given array Arr[] of non-negative integers, the task is to determine an integer X such that (Arr[0] XOR X) + (Arr[1] XOR X) + … + Arr[n – 1] XOR X is minimum possible.Input Arr[] = {3, 4, 5, 6, 7}Output X = 7, Sum = 10ApproachSo we will verify ‘i’th bit of every number of array in binary representation and consider and count those numbers containing that ‘i’th bit set to ‘1’ because these set bits will contribute to maximize the sum instead of minimize. As a result of this, we have to build this set ‘i’th bit ...

Read More

Killing threads in Java

AmitDiwan
AmitDiwan
Updated on 11-Mar-2026 437 Views

Examplepublic class Main{    static volatile boolean exit = false;    public static void main(String[] args){       System.out.println("Starting the main thread");       new Thread(){          public void run(){             System.out.println("Starting the inner thread");             while (!exit){             }             System.out.println("Exiting the inner thread");          }       }.start();       try{          Thread.sleep(100);       }       catch (InterruptedException e){     ...

Read More

Find a pair with given sum in a Balanced BST in Java

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 301 Views

ConceptWith respect of a given Balanced Binary Search Tree and a target sum, we write a function that returns true if there is a pair with sum equals to target sum, otherwise return false. In this case, expected time complexity is O(n) and only O(Logn) extra space can beimplemented. Here, any modification to Binary Search Tree is not permitted.We have to note that height of a Balanced BST is always O(Logn).ExampleMethodAccording to the Brute Force Solution, we consider each pair in BST and verify whether the sum equals to X. The time complexity of this solution will be O(n^2).Now a ...

Read More

jQuery .val change doesn't change input value?

AmitDiwan
AmitDiwan
Updated on 11-Mar-2026 4K+ Views

For this, you need to use attr(). The attr() method can be used to either fetch the value of an attribute from the first element in the matched set or set attribute values onto all matched elements.Following is the JavaScript code −Example Document $('#myURL').attr('value', 'http://www.facebook.com'); To run the above program, just save the file name anyName.html(index.html) and right click on the file and select the option open with live server in VSCode Editor.OutputLook at the above sample output the URL has been changed from ...

Read More

Find all reachable nodes from every node present in a given set in C++

Arnab Chakraborty
Arnab Chakraborty
Updated on 11-Mar-2026 721 Views

Suppose we have one undirected graph and a set of vertices; we have to find all reachable nodes from every vertex present in the given set.So, if the input is likethen the output will be [1, 2, 3] and [4, 5] as these are two connected components.To solve this, we will follow these steps −nodes := number of nodes in the graphDefine an array visited of size: nodes+1. And fill with 0Define one map mcomp_sum := 0for initialize i := 0, when i < n, update (increase i by 1), do −u := arr[i]if visited[u] is false, then −(increase comp_sum ...

Read More

Write a function to delete a Linked List in C++ Programming

sudhir sharma
sudhir sharma
Updated on 11-Mar-2026 756 Views

Here, we will create a function that will delete all elements of a linked list one by one.In c/c++, there is no specific function to perform this task but in java, the automatic garbage collection is done to ease deleting linked list.Now, let’s see the implementation of this program, Example#include using namespace std; class Node{    public:    int data;    Node* next; }; void deleteLinkedList(Node** head_ref){    Node* current = *head_ref;    Node* next;    while (current != NULL){       coutnext = (*head_ref);    (*head_ref) = new_node; } int main(){    Node* head = NULL;   ...

Read More

Write a function that generates one of 3 numbers according to given probabilities in C++

sudhir sharma
sudhir sharma
Updated on 11-Mar-2026 451 Views

In this problem, we have to create a function that will generate three numbers based on the given probability.For this, we will use the built-in random number generator function which is rand(a, b) which generates random numbers within the range [a, b] with equal probability.Our task is to return only three numbers A, B, C which have the probability of occurrence as P(A), P(B), P(C) respectively and according to definition of probability P(A) + P(B) + P(C) = 1.To create our function using rand(a, b). we will use its feature that the probability of occurrence of any number from a ...

Read More
Showing 26931–26940 of 61,297 articles
Advertisements