Swap Two Nibbles in a Byte | GFG POTD | C++ | Java | Code Kar Lo

Given a number n, Your task is to swap the two nibbles and find the resulting number.

A nibble is a four-bit aggregation, or half an octet. There are two nibbles in a byte. For example, the decimal number 150 is represented as 10010110 in an 8-bit byte. This byte can be divided into two nibbles: 1001 and 0110.

0:00 Introduction
0:12 Problem Statement
1:24 Explanation
5:39 C++ Code
6:18 Java Code

My DSA Journey:- https://youtu.be/quZBBv12mCQ

How to Earn By GFG Articles:- https://youtu.be/XjvEgkd49Gk

Infosys Coding Questions:- https://youtube.com/playlist?list=PLq3GlRZI14HuZlfpLmVY915bolizB8O2-

Problem Link:-https://www.geeksforgeeks.org/problems/swap-two-nibbles-in-a-byte0446/1

Code Link:-https://github.com/ShubhamKashyap138/Data-Structure/blob/main/Swap%20two%20nibbles%20in%20a%20byte

Playlist Link:-https://youtube.com/playlist?list=PLq3GlRZI14Hui2ILGsfF1Uf2RnbNu9wT3&si=UGRWpHbM8Q2w4TTQ

Linkedin:- https://www.linkedin.com/in/shubham-kashyap-65a29a218/

Instagram:- https://instagram.com/im_shubham_kashyap?igshid=YmMyMTA2M2Y=

My GFG Profile:- https://auth.geeksforgeeks.org/user/shubhamrajput6156/practice

gfg potd
gfg potd today
gfg problem of the day
potd gfg
potd
potd today
gfg
#dsa #datastructures #algorithm #gfg #potd #coding #array #strings #tree #binarysearchtree #codekarlo #dynamicprogramming

Видео Swap Two Nibbles in a Byte | GFG POTD | C++ | Java | Code Kar Lo канала CODE KAR LO