2425. Bitwise XOR of All Pairings | leetcode daily challenge | dsa | shashcode | java

preview_player
Показать описание
Problem Link:

Problem Statement:
You are given two 0-indexed arrays, nums1 and nums2, consisting of non-negative integers. There exists another array, nums3, which contains the bitwise XOR of all pairings of integers between nums1 and nums2 (every integer in nums1 is paired with every integer in nums2 exactly once).

Return the bitwise XOR of all integers in nums3.

Solution Link:

Bit Manipulation:
13 bits and binary operations:

14 play with bits:

15. Bit Interview Questions

Dynamic Programming:

Graph Playlist:

Java Plus DSA Placement Course Playlist:

Java Plus DSA Sheet:

Notes:

Telegram Link:

Ultimate Recursion Series Playlist:

Samsung Interview Experience:

Company Tags:
Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung

Timestamp:
0:00 - Introduction
Рекомендации по теме
Комментарии
Автор

like target for this video is 150. Please do like if you have understood the explanation as well as the code☺

shashwat_tiwari_st
Автор

Solved it myself, but came here to verify the best approach!(since python me 45% runtime show kar rha tha)
Thanks!

kidnamedfinger
Автор

Loved this solution...ek bar mei hi samjh aa gaya

R_ahul
Автор

great explaination bhaiya, keep continuing😊

tarunkumar
Автор

class Solution:
def xorAllNums(self, nums1: List[int], nums2: List[int]) -> int:
res=0
if len(nums1)%2==1:
for n in nums2:
res^=n
if len(nums2)%2==1:
for n in nums1:
res^=n
return res
python

yashagane
Автор

i solved it using brute lekin tle aa raha hai

SAMEERSINHA-gi
visit shbcf.ru