Bro apart from 9 entha number vachu modulus pannalum answer varuma

Bro super explanation💥. Its useful for my interview preparation😇

super explaination ........ you deserve more

Wrong bro time complexity was O(3N) not O(N) Because you traverse the array three times The edge case does not require

java

hi your explanation is very clear 🙂, but i have a doubt, you said this is 0(n) but finally you use nested loop, these kind of area i always get confused.

Bro set concepts use pannuga

class Solution { public int removeDuplicates(int[] nums) { int count = 1, item = nums[0]; for(int i = 1;i<nums.length;i++) { if(item != nums[i]) { item = nums[i]; nums[count++] = nums[i]; } } return count; } } not equal to ethu konjam fast ah iruku 0ms but space konjam efficient ila

Keep posting leetcode problems

Bro math function use pandraku bathila r ange vachi 1 to 6 set pannalam bro

Now they added a new constraint You must solve the problem without modifying the array nums and using only constant extra space.

50th like key: Lower the time means higher the speed, we can use a bucket to store the time from a particular position, and eliminating the need for sorting (n logn) -> n my code: public static int carFleet(int target, int[] position, int[] speed) { int fleets = 0; double maxTime = 0; int n = position.length; double[] times = new double[target]; for (int i = 0; i < n; i++) { times[position[i]] = (double) (target - position[i]) / speed[i]; } for (int i = target - 1; i >= 0; i--) { if (times[i] > maxTime) { fleets++; maxTime = times[i]; } } return fleets; }

bro @10:26 that optimal solution X+2 puriyaala bro, how we can say that X+2 we can't find the solution , here

asked in zoho 2024 october batch too

Bike manufacturering Java project podunga Tamil la please

Sir airline reservations system project podunga

Please continue this playlist bro

little bit confusing bro

After program explain the code

java

R and also PL/SQL VARRAY

Finally found perfect clear logical explanation video.

nice solution and explanation algo tamizha 😄

super explanation 🤩

Awesome Video

// User function Template for Java class Solution { // Function to find hIndex public int hIndex(int[] citations) { // code here Arrays.sort(citations); int n =citations.length; for(int i=0;i<n;i++){ if(citations[i]>=n-i){ return n-i; } } return 0; } }

Bro recently Zoho la intha qn kettanga. Itha solve pannunga bro Qn.nums= {3,4,7,2,1} O/p:{7,2,3,4,1} ->Odd numbers should be sorted in descending order in their corresponding index positions -> even numbers in ascending order without changing their corresponding index positions Solve panni upload pannunga bro

Bro ,amazon la idhe number of islands question la 0 between two 1s should be considered as bridge nu kuduthanga. adhaiyum bfs traversal la kekkuranga.. so number of islands BFS la epdi nusoli video podunga vro

Nice explanation Bro 🔥

Some of the problems la question la irukura number integer range ulla irukum but namma (left+right) add pannaila integer range ah vida athigama poirum soo right tha bigger atha left vachu subtract panitu atha divide panitu thirumba left ah add panikurom

❤❤

Mid = left + (right - left ) / 2 Reason : if we sum like (left + right) it may be out of integer range so , use left + (right - left ) / 2

awesome explanation

Daii Badu yaa da sollu tholaiya da video length akuraa

super

Semma Video explanation bro. Tamil-a sonnathu innum super!!

3rd question 10011

Thanks a lot it seems super easy now

use ascii instead of prime numbers

is this code ok? " String s="123456789"; for (int i=0;i<s.length();i++){ for(int j=0;j<s.length();j++){ if(i==j || i+j==s.length()-1){ System.out.print(s.charAt(j)); }else { System.out.print(" "); } } System.out.println(); "

Bro this code also give solution : " int[] a={11,31,4,3,9}; int[] b= new int[a.length]; Arrays.sort(a); int s=0,e=a.length-1; for(int i=0;i<a.length;i++){ if(i%2==0){ b[i]=a[e]; e--; }else{ b[i]=a[s]; s++; } } System.out.print(Arrays.toString(b)); " Is this correct?

Inbuild functions use panalama like Contains() in this problem. allowed ah in competitive programming

Zoho ku ponum na java la endha concepts Vara therinja podhum bro . Awt enough ah illa swing um parkanuma bro . Core Java enough ah bro ?

Thank You Sir .. Sir Semma Explanation ❤😁🙏🙏

i can i understand bro , thank you

Super explanation ❤

Bro wildcard matching leetcode prblm pani poduga bro

Awesome

Its november month today challenge. I solved today mrng.

Super bro