My Programming Blog

ThreeSum in java. Given an array nums of n integers , are there elements a , b , c in nums such that a + b + c = 0 Find all unique triplets in the array which gives the sum of zero. Note the solution set must not contain duplicate triplets. Example : Given array nums = [ -1 , 0 , 1 , 2 , -1 , -4 ] A solution set is : [ [-1 , 0 , 1], [ -1, -1, 2], ] import java.util.*; class ThreeSum { static List<List<Integer>> calculate(int[] arr) { if(arr == null || arr.length < 3) { return Collections.emptyList(); } int n = arr.length; List<List<Integer>> list = new ArrayList<List<Integer>>(); Map<Integer,Integer> map = new HashMap<>(); for(int i=0;i<n-2;i++) { int first = arr[i]; for(int j=i+1;j<n;j++) { int remain = first+arr[j]; remain = (remain<0)?Ma...

 Marvel Tic Tac Toe Android Game ( Java ) In this blog I we will create basic android app. We will be coding in java.   package com.example.batvsiron ; import androidx.appcompat.app.AppCompatActivity ; import android.os.Bundle ; import android.util.Log ; import android.view.View ; import android.widget.Button ; import android.widget.GridLayout ; import android.widget.ImageView ; import android.widget.TextView ; import android.widget.Toast ; import java.util.Arrays ; public class MainActivity extends AppCompatActivity { int active = 0 ; public int [][] winningPosition = { { 0 , 1 , 2 } , { 3 , 4 , 5 } , { 6 , 7 , 8 } , { 0 , 3 , 6 } , { 1 , 4 , 7 } , { 2 , 5 , 8 } , { 0 , 4 , 8 } , { 2 , 4 , 6 } } ; public int [] moves = { 111 , 111 , 111 , 111 , 111 , 111 , 111 , 111 , 111 } ; public int checkWinning () { for ( int [] arr : winningPosition ) { ...

 Operating System Lecture 1 Notes video link : https://youtu.be/By6lWjiPpVI A. Operating system :