you are unable to explain.

In order to make your Example work in the Immutable class you should change private final Engine engine to public final Engine engine; Otherwise it will not be accessible in the main class as System.out.println(immutableClass.engine.speed); I wonder how come you are bale to access private object of Engine in the main method using ImmutableClass object.

Again, this accent! Nope!

Thanks...

public class SeperateZeroAndOne { public static void main(String[] args) { int[] nums = {0,1,0,1,0,1}; int left=0,right=nums.length-1; System.out.println("Start it"); while(left<right) { if(nums[left]==1) { while(nums[right]!=0) { right--; } int temp=nums[left]; nums[left]=nums[right]; nums[right]=temp; } left++; right--; } for(int i:nums) { System.out.println(i); } } }

Guruji how are you doing Looking for upcoming OpenAI sessions

May i know how the same can be done with Python, If any is not present or displayed then it should fail it with a message

Beautiful

Very less information provided

Super

very nice explanation

Ye kya hua...humne kahan inset kia last me value....ye to wahi reh gaya...5 number insted.

Didn't though this question can be solved by sorting with some small changes!!

Great video. But does anyone know leetcode link for this problem?

watching it now, and its still very good compare to other tutorials. great work @Coding Simplified.

Bro thanks a lot!

good explanation but can you simulate multiple user scenario using threads?

Tqs ku god

What will be the complexity in average and best case and how?

Nice explanation!! In this design pattern we are creating instance in factory class using if else depending on our requirement but what if class name of bike or car changes ? Then we need to change instance name in factory class. Can we loosely coupled it as well?

Nice Explaination

Great Content. Thanks bhai❤

clear explanation thanks

void addNode(Node head_ref, int pos, int data) { // Your code here if (head_ref == null) { Node newnode = new Node(data); newnode.next = null; newnode.prev = null; } Node current = head_ref; for (int i = 0; i < pos + 1; i++) { Node newnode = new Node(data); // Corrected typo if (i == pos) { Node nextbig = current.next; current.next = newnode; newnode.prev = current; newnode.next = nextbig; // Corrected variable name nextbig.prev = newnode; // Corrected variable name } else { current = current.next; } } } }

Hey man.

how to print 1st 2 character ??

Thank you so much

Thank you so much sir For simplified explanation.

Hi, why can't we use for loop to see if any row or column is empty, so we can confirm whether it's connected or not?

nice and brief explanation

What a silly video? You need to do all that to just sort numbers from 1 to n? Why can'y you just do for each index i, arr[i] = i+1?

I watched your all videos on TREE and I feel it can turn anyone Zero to hero.. Mastering Binary Trees.

Thanks a lot)

Tysm

Thanks for the explanation, but will this work when numbers are negative?

#include <bits/stdc++.h> using namespace std; bool Triplet(int arr[], int arr_size, int sum) { int l, r, m; // for left ,right and middle sort(arr, arr + arr_size); for (int i = 0; i < arr_size - 2; i++) { l = 0; r = arr_size - 1; m = (l + r) / 2; while (l < r) { if (arr[l] + arr[m] + arr[r] == sum) { cout << "Triplet is: " << arr[l] << "," << arr[m] << "," << arr[r]; return true; } else if (arr[l] + arr[m] + arr[r] < sum) l++; else r--; } } return false; } int main() { int n, k, arrsize; cout << "Enter number of elements:"; cin >> n; int array[n]; cout << "Enter the elements:"; for (int i = 0; i < n; i++) { cin >> array[i]; } cout << "Enter the sum:"; cin >> k; for (int i = 0; i < n; i++) arrsize = sizeof(array) / sizeof(array[0]); Triplet(array, arrsize, k); return 0; }

if you are taking -2 as second case then -3 also will be in arraay whyyou skip those cases that"s why many of us getting error in duplicate element cases ..

DP solution is WRONG does NOT PASS ALL THE TEST-CASES PASSES only 84 of them has been passed.

BRO ITS 2024

your way of explanation is really superb brother really ...... so good please make vedeos on data structures and algorithms as well. Once again thank you so much.😊

Thanks for sharing 🤩, very nice explanation.

very well explained.

Great explanation. Can you please tell the time complexity for this?

Thanks a lot brother for your clear explanation.

Very nicely explained

💗💗💗Many thanks!💗💗💗

amazing explaination

no such options on mine... it doesnt have the three dots or MORE.. option

Thanks a lot♥

Ok