Posts

wt project

  That’s a brilliant idea, R—blending Local Resource Directory , Blood Donor Availability , and AI Integration into one cohesive project can create something truly impactful for your community. Let’s sketch out how you can combine all three into a single front-end web app using HTML, CSS, JavaScript, and free AI APIs. 🧩 Project Name Suggestion: “Community Connect” — a smart, searchable platform for essential services and life-saving support. 🧱 Core Modules Breakdown 1. Local Resource Directory 📍 Cards for hospitals, schools, shelters, helplines 🔍 Search bar to filter by name, category, or location 🗺️ Google Maps iframe for location previews 2. Blood Donor Availability 🩸 Donor cards with name, blood group, location, contact ✅ Availability toggle (e.g., “Ready to Donate”) 🔍 Filter by blood group or city 🧠 Optional: AI-assisted matching (e.g., “Find O+ donors near Vizag”) 3. AI Integration 💬 Chatbot assistant to guide users: “Where’s the nearest shelte...
Post a Comment
Read more

what i learn

  Great question, R — and I love that you're thinking critically about how indexing works in loops. Let's clarify this with precision. 🧠 Why neg[i++] Starts at Index 0 When you write neg[i++] , you're accessing the current value of i , then incrementing it. So if i = 0 , this line: combine[k++] = neg[i++]; means: Use neg[0] (the first element). Then increment i to 1. So you're not saying i++ = 1 — you're saying: "Use i = 0 now, and after this line, i becomes 1." This is called post-increment , and it's a common pattern in Java when you want to use the current index before moving to the next. 🔍 Quick Illustration int i = 0; System.out.println(neg[i++]); // prints neg[0], then i becomes 1 System.out.println(neg[i]); // now prints neg[1] So the loop starts at index 0 because arrays in Java are zero-indexed — meaning the first element is at position 0, not 1. ✅ Summary i++ means "use current i , then increment....
Post a Comment
Read more

creative codes

 //finding An equilibrium index is a position in the array where the sum of elements to the left = sum of elements to the right . // Online Java Compiler // Use this editor to write, compile and run your Java code online class Main {     public static void main(String[] args) {         int[] arr = {3, 4, 8, -9, 20, 6};         int n = arr.length;         int sum=0;         boolean found=false;          for(int i=0; i<n;i++)  sum+=arr[i];          int left_sum=0;                    for(int i=0;i<n;i++){              int right_sum=sum-left_sum-arr[i];              if(left_sum==right_sum){                  found=true;                 ...
Post a Comment
Read more

DSA

 Nice question 👍 You’re asking: 👉 After finishing subarray problems, what’s the next topic left in arrays in DSA? Let me give you a roadmap of array topics in DSA so you see what comes after subarrays: 🔹 Array Topics in DSA (Progression) Basics Traversal, Insertion, Deletion Searching (Linear, Binary Search) Prefix / Suffix Concepts Prefix Sum Suffix Sum Difference Array Subarrays (you’ve done this) Kadane’s Algorithm (max sum subarray) Sliding Window (fixed & variable size) Two Pointer Technique Problems like Longest Increasing Subarray, Equal 0s & 1s, etc. ✅ You’re here. Subsequences vs Subarrays Subarray = contiguous Subsequence = not necessarily contiguous Example problems: Longest Increasing Subsequence (LIS) Maximum Sum Increasing Subsequence Sorting-based Array Problems Merge Intervals Inversion Count (using merge sort) Sorting 0s,1s,2s (Dutch National Flag) Searching in Arrays ...
Post a Comment
Read more

using methods to solve problem

//for finding maximum subarray sum:  class Main {     public static void main(String[] args) {         int[] arr = {4, -1, 2, 1};         int cur_sum = arr[0];         int max_sum = arr[0];  // track the best sum so far         for (int i = 1; i < arr.length; i++) {             // either extend the previous subarray OR start fresh from arr[i]             cur_sum = Math.max(arr[i], cur_sum + arr[i]);             // update the maximum sum found so far             max_sum = Math.max(max_sum, cur_sum);         }         System.out.println("Maximum Subarray Sum = " + max_sum);     } } //for finding minimum subarray of the sum:  class Main {     public static void main(String[] args) {       ...
Post a Comment
Read more

mistakes in java

 // Online Java Compiler // Use this editor to write, compile and run your Java code online class Main {     public static void main(String[] args) {        int [] arr = {16, 17, 4, 3, 5, 2};        int [] leader=new int[arr.length];        int index=0;         for(int i=arr.length-1;i>0;i--){     for(int j=i-1;j>=0;j--)     if(arr[i]>arr[j]){         leader[index++]=arr[i];     } } leader[0]=arr[arr.length-1]; for(int ele:leader){     System.out.println(ele); }     } }
Post a Comment
Read more

optimsed apporach

//For finding buying and seeling the stock:  class Main {     public static void main(String[] args) {         int[] price = {8, 2, 1, 5, 4, 6};         int min = Integer.MAX_VALUE;         int max = 0;         for(int i=0;i<price.length;i++){             if(price[i]<min){                 min=price[i];             }             else if(price[i]-min>max){                 max=price[i]-min;             }         }         System.out.println("Buy:"+min);                 System.out.println("sell:"+max);     } } //finiding leader in an array: // Online Java Compiler // Use this editor to write, compile and...
Post a Comment
Read more