Video

kunal and you are doing an excellent job ! Thank You <3

Leet code ki easy solutions bhi medium level ke hai

It seema to be little difficult for beginners who have directly come for solving questions after understanding the concept of array.😢😢😢😢😢. logic of solving this Question didn't strike in my mind..

Nice Explanation sir..

Great explnation man!

thanks,btw nice explanation ✔✔❣❣

class Solution { public: int finalValueAfterOperations(vector<string>& operations) { int x = 0; int n = operations.size(); for (int i = 0;i <n;i++){ if(operations[i] == "++X" || operations[i] == "X++"){ x++; } else{ x--; } } return x; } };

good work bro !!!!!!!!!!!

pen paper leh le bhai usmai humlogo ko better dikhaga

Nice thanks

Compilation Error ./Solution.cpp: In function 'void iter(std::vector<int>::iterator, std::vector<int>::iterator)': ./Solution.cpp:19:22: error: 'it' was not declared in this scope for(it1;it1!=it2;it++)

NICE SUPER EXCELLENT MOTIVATED

use LinkedList to improve the time complexity as insertion is O(1) in LinkedList and O(n) in array list

why the time complexity is not o(n*m)

why my code is not running var twoSum = function(nums, target) { for(let i=0;i<nums.length;i++) { for(j=i+1;j<nums.length;j++) { if((nums[i]+nums[j])==target) { console.log("the indices where target matched is="); console.log("["+i+","+j+"]"); } } } };]

iska logic kaise banaya bhai? mai kaise aise sochna seekh pau? ye to mai soch hi nhi skta tha kbhi to

bro help why its not passing all test case? it tried to solve using binary search import java.util.Arrays; class Solution { public boolean checkIfExist(int[] arr) { Arrays.sort(arr); for (int i = 0; i < arr.length; i++) { if (binarySearch(arr, arr[i], i)) { return true; } } return false; } private boolean binarySearch(int[] arr, int target, int i) { int start = 0; int end = arr.length - 1; while (start <=end) { int mid = start + (end - start) / 2; if ((mid != i)&&(arr[mid]/2 == target )) { return true; } else if (arr[mid] < target && mid!=0) { start = mid + 1; } else { end = mid - 1; } } return false; } }

nums=[0,2,1,5,3,4] result1=[] for i in range(len(nums)): result=nums[nums[i]] result1.append(result) print(result1)

thank u brother ,

Thank you bro

IN while loop, it should be greater than or equal to 1

nice explanation

Thankyou man!

Since it is given that 0<=nums[i]<=n, there is need to do mod with n.

Bro 1920 ???

Loved this explanation and concept. Thank you

how did you come up with this approach? I mean the thought process

2:47 bich wala flip nhi krenge agar 3*3 ki matrix hui but agar 4*4 ki matrix hui toh kyuki agr 4*4 Me pura flip krenge toh bech me pura flip hoga na. Im bit confused here

spiral matrix 3 wala solve kro plez............

bhai spiral matrix 3 ispe video banao plez

tysm for the explanation

thanks bhaiya

Thank you brother

Excellent explanation!

improve handwriting please

Thanks brother

In question it is written that we have to return the first occurrence of the max year which will be not the case with brute force solution

yrr code linke de dena chaey tha tb hm c++ me convert kr lete

he is confused as well and making us confusee

Brilliant🎉

why u placed the king at( 3,3 )coordinate only

Nice explanation

Great explanation

👏🔥 Kudos to you for this amazing video! Keep up the fantastic work! 🚀💡

guess fn kaha gaya ? gemd me dal liye kya guess fn

bro you should use a black pen instead of red

what is math.log10()?? how does it works?

Good explanation bro bs ye mat[n-1-i] wla logic nhi samajh aaya ? Bata do koi agar janta hai toh

nice explain sir😊

worst explaination ever