Object Oriented Programming

GATE

Data Structures

Data Structures in Python

Power BI

Data Science

Django

Data Structure and Algorithm

Python

Recursion

Arrays

Searching

Sorting

String

Linked List

Data Structures in C

Algebra

Maths

Strings

C++ Tricks

System Design

Theory of Computation

Computer Organization and Architecture

Operating System

Engineering Mathematics

Database

Digital Logic

Computer Networks

GATE 2022

Java

GeeksforGeeks School

Hashing

Competitive Programming

Problem of the Day

School

HTML

Javascript

Bootstrap

Web Development

Android

Excel

Microsoft Office

Machine Learning

Resume Builder

Miscellaneous

Gblog

TechTips

React

Advanced JavaScript

DSA Self Paced

CS-subjects

Data Structures and Algorithms

Operating Systems

C Language

DBMS

Basics of CPP

Data Structures ( Basics )

Object Oriented Design

Dynamic Programming

Data Interpretation and Logical Reasoning

Algorithms

Core Java

RESTful APIs

Spring Basics

CPP-Tricks

Basics of Java

Aptitude

GATE YT

Flutter

Application Development

Blockchain

GFG SDE Sheet

SDE Sheet

Deep Learning

Go Programming

Placement

C++ Programs

Data Visualisation

DevOps

Docker

Queue

Matrix

Trie

Stack

Graph

Tree

Magic Numbers

Divide and Conquer

React Native

React JS

Interview-Questions

Advanced Java

cloud-computing

income tax

Artificial Intelligence

Programming Languages

Computer Graphics

Cyber Security

Project Management

DSA / Placements

DA / Data Science & AI

Development

DevOps Course

All Courses

Courses

ML & Data Science

CS Subjects

Software and Tools

School Learning

Tutorials

Interview Corner

Practice DSA

GfG 160

Interview Prep

For more details, please go through - <a href="https://www.geeksforgeeks.org/dsa/count-set-bits-in-an-integer/">Count set bits in an integer</a>

Count Set Bits.

The simple approach is to create a list and add all values from 1 to n to it. Create a recursive function that takes a list, start (position at which counting will start), and k ( number of people to be skipped) as an argument. If the size of the list is one i.e. only one person left then return this position.&nbsp;Otherwise, start counting the k person in a clockwise direction from starting position and remove the person at the kth position. Now the person at the kth position is removed and now counting will start from this position. This process continues till only one person is left.Josephus Problem : <a href="https://www.geeksforgeeks.org/josephus-problem-set-1-a-on-solution/">https://www.geeksforgeeks.org/josephus-problem-set-1-a-on-solution/</a>

Josephus Problem

Given a number n, check if the Kth bit of n is set or not. &nbsp;Examples:Input : n = 5, k = 1 Output : SET 5 is represented as 101 in binary and has its first bit set.Input : n = 2, k = 3 Output : NOT SET 2 is represented as 10 in binary, all higher i.e. beyond MSB, bits are NOT SET. Check whether K-th bit is set or not &nbsp;: <a href="https://www.geeksforgeeks.org/check-whether-k-th-bit-set-not/">https://www.geeksforgeeks.org/check-whether-k-th-bit-set-not/</a>

Check whether K-th bit is set or not

Given an integer array of n integers, find sum of bit differences in all pairs that can be formed from array elements. Bit difference of a pair (x, y) is count of different bits at same positions in binary representations of x and y.&nbsp; For example, bit difference for 2 and 7 is 2. Binary representation of 2 is 010 and 7 is 111 ( first and last bits differ in two numbers).Examples : &nbsp;Input: arr[] = {1, 2} Output: 4 All pairs in array are (1, 1), (1, 2) &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; (2, 1), (2, 2) Sum of bit differences = 0 + 2 + &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 2 + 0 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;= 4Sum of bit differences among all pairs : <a href="https://www.geeksforgeeks.org/sum-of-bit-differences-among-all-pairs/">https://www.geeksforgeeks.org/sum-of-bit-differences-among-all-pairs/</a>

Sum of bit differences among all pairs

Welcome to the daily solving of our PROBLEM OF THE DAY with Nitin Kaplas. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Bits Manipulation but also build up problem-solving skills. Given a number n, find the number of binary strings of length n that contain consecutive 1's in them. Since the number can be very large, return the answer after modulo with 1e9+7.Example 1:Input: n = 2
 Output: 1
 Explanation: There are 4 strings of length 2, the strings are 00, 01, 10, and 11. Only the string 11 has consecutive 1's.Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://practice.geeksforgeeks.org/problems/trail-of-ones3242/1">https://practice.geeksforgeeks.org/problems/trail-of-ones3242/1</a>

PROBLEM OF THE DAY : 03/06/2024 | Trail of ones

Welcome to the daily solving of our PROBLEM OF THE DAY with Yash Dwivedi. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Bit Manipulation but also build up problem-solving skills. Given a binary representation in the form of a string(s) of a number n, the task is to find a binary representation of n+1.Note: Output binary string should not contain leading zeros.Example 1:Input: s = "10"
 Output: 11
 Explanation: "10" is the binary representation of 2 and binary representation of 3 is "11"Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://practice.geeksforgeeks.org/problems/binary-representation-of-next-number3648/1">https://practice.geeksforgeeks.org/problems/binary-representation-of-next-number3648/1</a>

PROBLEM OF THE DAY : 04/06/2024 | Binary representation of next number

Welcome to the daily solving of our PROBLEM OF THE DAY with Siddhartha Hazra. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Bit Manipulation but also build up problem-solving skills. Given a list s that initially contains only a single value 0. There will be q queries of the following types:<ul><li>0 x: Insert x in the list</li><li>1 x: For every element a in s, replace it with a ^ x. ('^' denotes the bitwise XOR operator)</li></ul>Return the sorted list after performing the given q&nbsp;queries.Example 1:Input:
 q = 5
 queries[] = {{0, 6}, {0, 3}, {0, 2}, {1, 4}, {1, 5}}
 Output:
1 &nbsp;2 3 7
 Explanation:
 [0] (initial value)
 [0 6] (add 6 to list)
[0 6 3] (add 3 to list)
 [0 6 3 2] (add 2 to list)
 [4 2 7 6] (XOR each element by 4)
 [1 7 2 3] (XOR each element by 5)
The sorted list after performing all the queries is [1 2 3 7].&nbsp;Give the problem a try before going through the video. All the best!!! Problem Link:<a href="https://practice.geeksforgeeks.org/problems/construct-list-using-given-q-xor-queries/1"> https://practice.geeksforgeeks.org/problems-/construct-list-using-given-q-xor-queries/1</a>

PROBLEM OF THE DAY : 02/06/2024 | Construct list using given q XOR queries

Welcome to the daily solving of our PROBLEM OF THE DAY with Nitin Kalpas. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Bit Manipulation but also build up problem-solving skills. Given a string s&nbsp;of&nbsp;lowercase English characters, find out whether the summation of x and&nbsp;y&nbsp;is&nbsp;even&nbsp;or&nbsp;odd, where x is the count of distinct characters that occupy&nbsp;even positions in English alphabets and have even frequency, y&nbsp;is the count of distinct characters which occupy&nbsp;odd positions in English alphabets and have odd frequency. Note: Positive means greater than zero.Example 1:Input:&nbsp; s = "abbbcc"
 Output:&nbsp; ODD
 Explanation:&nbsp; x = 0 and y = 1 so (x + y) is ODD. 'a' occupies 1st place(odd) in english alphabets and its frequency is odd(1), 'b' occupies 2nd place(even) but its frequency is odd(3) so it doesn't get counted and 'c' occupies 3rd place(odd) but its frequency is even(2) so it also doesn't get counted.Give the problem a try before going through the video. All the best!!! Problem Link:<a href="https://practice.geeksforgeeks.org/problems/help-nobita0532/1"> https://practice.geeksforgeeks.org/problems/help-nobita0532/1</a>

PROBLEM OF THE DAY : 01/06/2024 | Odd Even Problem

Welcome to the daily solving of our PROBLEM OF THE DAY with Yash Dwivedi. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Bit Manipulation but also build up problem-solving skills. Given a number n, Your task is to swap the two nibbles and find the resulting number.&nbsp;A <a target="_blank" rel="noopener noreferrer nofollow" href="http://en.wikipedia.org/wiki/Nibble">nibble</a> 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.Example 1:Input: n = 100
 Output: 70 Explanation: 100 in binary is 01100100, two nibbles are (0110) and (0100). If we swap the two nibbles, we get 01000110 which is 70 in decimal.Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://practice.geeksforgeeks.org/problems/swap-two-nibbles-in-a-byte0446/1">https://practice.geeksforgeeks.org/problems/swap-two-nibbles-in-a-byte0446/1</a>

PROBLEM OF THE DAY : 31/05/2024 | Swap two nibbles in a byte

Dive into the basics of computer science with our detailed tutorial on understanding and creating the binary representation of a given number. This video is perfect for beginners in programming, students in computer science, and anyone interested in the fundamental principles of how computers process and store information.In this tutorial, you'll learn:<ul><li>The concept of binary numbers and why binary representation is crucial in the world of computing.</li><li>Step-by-step methods to convert a decimal number into its binary form, which is essential knowledge for programming, data processing, and understanding how computers work.</li><li>Practical coding demonstrations that guide you through writing programs in various programming languages to perform decimal to binary conversion, reinforcing your coding skills and conceptual understanding.</li><li>Visual explanations and examples to help you grasp the binary system and how it relates to everyday computing tasks.</li><li>Tips for avoiding common mistakes and optimizing your code for better performance and readability.</li></ul>By the end of this video, you’ll not only understand binary representation but also be able to apply this knowledge in practical scenarios, enhancing your programming abilities and your comprehension of computer operations.For a more comprehensive exploration of this topic, including code snippets and additional resources, make sure to visit our full article: <a href="https://www.geeksforgeeks.org/binary-representation-of-a-given-number/">https://www.geeksforgeeks.org/binary-representation-of-a-given-number/</a>

Binary Representation | DSA Problem

Hey, fellow problem-solvers! 🧩 Ever struggled with finding that elusive number occurring an odd number of times? In this video, we'll unravel the mystery behind this intriguing problem!Join us as we explore efficient techniques to identify numbers occurring an odd number of times in an array. With clear explanations and practical examples, we'll guide you through the process step-by-step. Whether you're a seasoned coder or just starting your journey into the world of programming, this video is packed with insights to sharpen your skills.Ready to crack the code and uncover those odd occurrences? Hit play now and let's dive into the world of problem-solving! 💡💻🔗 Dive into the details: <a href="https://www.geeksforgeeks.org/find-the-number-occurring-odd-number-of-times/">https://www.geeksforgeeks.org/find-the-number-occurring-odd-number-of-times/</a>

Exceptionally odd | DSA Problem

Explore the intriguing problem of dividing two integers without using multiplication, division, or modulus operators with our comprehensive tutorial. This guide is perfect for computer science students, programmers, and anyone interested in mastering bitwise operations and algorithmic problem-solving.In this tutorial, you'll learn:<ul><li>Understanding the Problem: Gain a foundational understanding of the task, which involves dividing two integers using only addition, subtraction, and bitwise operations. The challenge is to implement the division operation efficiently without directly using the standard arithmetic operators for division.</li><li>Bitwise Operations Basics: Refresh your knowledge of bitwise operations, which are crucial for implementing the solution. Understand how bit shifts can be used to manipulate and compare binary representations of numbers.</li><li>Algorithm Explanation: Detailed explanation of the algorithm to solve the problem:<ul><li>Handling Edge Cases: Learn how to handle edge cases such as division by zero, division involving negative numbers, and overflow scenarios.</li><li>Using Bit Shifts: Explore how to use left and right bit shifts to approximate the division process. This involves repeatedly subtracting multiples of the divisor from the dividend.</li><li>Step-by-Step Division Process: Understand how to iteratively subtract the largest possible multiple of the divisor (using bit shifts) from the dividend, adjusting the quotient accordingly.</li></ul></li><li>Step-by-Step Code Implementation: Detailed code examples in popular programming languages like Python, Java, and C++. These examples will demonstrate how to implement the division algorithm efficiently using bitwise operations.</li><li>Complexity Analysis: Discuss the time complexity of the solution, which is 𝑂(log⁡𝑛)O(logn) due to the iterative bit shifting process. The space complexity is 𝑂(1)O(1) since the solution uses a fixed amount of additional space.</li><li>Handling Edge Cases: Tips on managing various edge cases, such as dividing by zero, handling the minimum and maximum integer values, and ensuring the implementation works for both positive and negative integers.</li><li>Visual Examples and Diagrams: Include diagrams to visually demonstrate the bitwise division process, helping to clarify the steps involved in approximating the division operation.</li><li>Applications and Real-World Use: Discuss real-world applications of this technique in scenarios where standard arithmetic operations may not be available or efficient, such as in low-level programming or certain embedded systems.</li></ul>By the end of this tutorial, you’ll be well-equipped to divide two integers without using multiplication, division, or modulus operators, enhancing your understanding of bitwise operations and algorithmic problem-solving.For a comprehensive guide on dividing two integers without using multiplication, division, or modulus operators, including detailed explanations, code examples, and practical tips, check out our full article at <a href="https://www.geeksforgeeks.org/divide-two-integers-without-using-multiplication-division-mod-operator/">https://www.geeksforgeeks.org/divide-two-integers-without-using-multiplication-division-mod-operator/</a>.This tutorial will not only improve your understanding of bitwise operations but also prepare you to tackle similar challenges in your software development and algorithmic problem-solving endeavours.

Division without using multiplication, division and mod operator | DSA Problem