Відео

hello what did you do at 1:46 ? [ 2*2*f(n+1) ] why not 2*f(n+1) ?? also if (n == 4), it returns 4. shouldn't it simply give 4 as an output. why are you returning the else part?

Thank you sir your content is very useful

72

Answer in description with Explanation ❤

5:15 o/p=1

Nice explanation 👍

Bhai ye prblm k karan aaj mera test gaya yar sahi code likha tha yar pura waste hogaya yar

Answer hoga ........... Mohe ni pto

Good question bro Got right answer in the first attempt

Question is incomplete👎👎

I want a separate video for every channel related to Accenture company and also related to topics

In how many days we can get a resulr

Question 7 amswer is north-east

q1. class Solution { public int missingNumber(int[] nums) { int n = nums.length; int sum = 0; int misnum = 0; int total = n*(n+1)/2; for(int i=0;i<n;i++) { sum=sum+nums[i]; misnum = total-sum; } return misnum; } }

Amazing ❤

How many coding questions and how much time?

in 2nd Q the ans should be 888

{ int x = 57; int count = 0; int n = 0; for (int i = x - 1; i > 2; i--) { if (x % i == 0) { n = x / i; count++; break; }else{ while(!(x%2==0)){ x = x -1; count++; } } } while (n != 1 && n != 0) { n = n - 1; count++; } System.out.print(count); } is this correct?

i need datasufficiency topic

Absolute masterpiece heart touching

Friends friends baar baar mt bola kr bhai irritating hota h

thank you so much

private static int minOperationsToReduceToOne(int n) { int operations = 0; // Counter to store the number of operations // Iterate until n becomes 1 while (n > 1) { boolean divided = false; // Flag to check if we were able to divide // Full for loop to find the largest divisor from n-1 to 2 for (int x = n - 1; x > 1; x--) { if (n % x == 0) { // If n is divisible by x n = n / x; // Divide n by x operations++; // Increment the operations count divided = true; // Set the flag to true break; // Exit the loop after the division } } // If no division happened, we subtract 1 from n if (!divided) { n -= 1; // Subtract 1 from n operations++; // Increment the operations count } } return operations; // Return the total number of operations } }

int a=9,b=9,c=19,d; c=--b; 8 b=--a; 8 d=a++ - ++b +c++; cout<<a<<" "<<b<<" "<<c<<" "<<d; //9 9 9 7

Pdf is locked 😢

Hey my coding round is in this month can I use the python language for solving DSA questions

which concept is thiss??

Sir some of the staff saying that EXOR method will be mention in as word like "1 XOR P" in pseudocode what is yours opinion sir

Stl use kar sakte hai ki nhi coding question me??

Tq brother keep doing

if we didnt submit the code but automatically it got submitted beacuse of time. will my code considered for process

How many questions do we need to pass inorder to go to next process

Anybody watching the video for today's afternoon exam ? 😂😂

I think it's a Trapping rainwater Question right?

Is there anybody seeing this video for tomorrow exam

Bs bolna hi h hua...yeh sab pata hi h sab ko lpa jane k nhi aaye h... Crack kaise kr sakte h o batao...

Pls help how to prepare for soti coding.... It's on 27th July....

How to prepare coding .. tomorrow i have soti coding round

Bro we have 1st round exam from SOTI can you tell the pattern and topics to learn for 1st round exam

public class ubm2 { public static void main(String[] args) { int n=7; // it depends upon you int arr[]={1,2,3,4,5,7}; int j=0; int miss=0; for(int i=1;i<n;i++){ if(i!=arr[j]){ miss =i; } else{ j++; } } System.err.println(miss); } }

Iam not attended this assessment what iam do now any solution

bhaiya ess saal ke liye bhi dijiye

Please upload sample questions

flipkart engineers ko hire kar rha hai 32 lakh ki salary par, uspe banao video

Hats off to you !!!

Is it basic coding ok. Or with dsa

number =input() digit = input() res = 0 for i in range(len(number)): if number[i] == digit: res = max(res,int(number[0:i]+number[i+1:])) print(res)

Pls help how to prepare for soti coding... It's on 27 July 2024

Superb bro

BRO..I HAVE SOTI EXAM ON 27 TH JULY WHAT CODING QUESTION SHOULD I PREPARE