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

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

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

GATE Prep

Data Analytics / Data Science

Development

Cloud / DevOps

All Courses

Courses

ML & Data Science

Interview Corner

CS Subjects

School Learning

Software and Tools

Tutorials

Google Build with AI

Practice Coding Problems

Connect 1:1 with Experts

Practice

Apply Now!

Post Jobs

Jobs Updates

Jobs

We are given a string. We are also given indexes of first and last characters in string. The task is to reverse the string without using any extra variable.Examples:Input &nbsp;: str = "abc" Output : str = "cba"Input : &nbsp;str = "GeeksforGeeks" Output : str = "skeeGrofskeeG"Reverse string without using any temporary variable: <a href="https://www.geeksforgeeks.org/reverse-string-without-using-any-temporary-variable/">https://www.geeksforgeeks.org/reverse-string-without-using-any-temporary-variable/</a>

Reverse string without using any temporary variable

Enhance your understanding of digital coding systems with our detailed tutorial on converting between Gray code and binary code. This video is perfect for electronics enthusiasts, computer engineers, and programmers who are interested in the intersection of computer science and digital electronics.In this tutorial, you'll learn:<ul><li>What Gray code is, how it differs from binary code, and why it is used in digital systems to prevent errors during data transmission.</li><li>Step-by-step methods for converting a binary number into Gray code and vice versa, a crucial technique in various applications including error correction and digital encoders.</li><li>Coding demonstrations that guide you through the process of implementing these conversions in several programming languages, ensuring a comprehensive understanding of the algorithms involved.</li><li>Practical examples that illustrate the use of Gray code in real-world scenarios, helping you see the practical applications of these conversions in technology and engineering.</li><li>Optimization tips and best practices for coding these conversions, making sure your implementations are efficient and suitable for performance-critical applications.</li></ul>By the end of this video, you’ll have a thorough grasp of Gray code and binary code conversions, equipping you with the knowledge to handle related challenges in both academic and professional settings.For a deeper dive into this topic, including detailed code examples and further explanations, make sure to visit our full article: <a href="https://www.geeksforgeeks.org/gray-to-binary-and-binary-to-gray-conversion/">https://www.geeksforgeeks.org/gray-to-binary-and-binary-to-gray-conversion/</a>

Binary To Gray Code Equivalent | DSA Problem

Embark on a journey through the world of bitwise operations with this comprehensive guide from GeeksforGeeks on finding the maximum subset XOR of a given set. In this illuminating article, you'll explore essential concepts and algorithms for efficiently identifying the subset with the highest XOR value, a critical skill for various applications such as cryptography, data encryption, and algorithm optimization.Discover the principles behind finding the maximum subset XOR as you delve into various approaches and techniques for analyzing set elements. Whether you're a coding enthusiast or a seasoned developer, mastering the art of bitwise manipulation is essential for optimizing computational resources and solving complex problems.Prepare to elevate your problem-solving skills and algorithmic proficiency as you explore detailed explanations and practical examples for determining the maximum subset XOR. Unlock the full potential of bitwise operations in your projects by delving into the accompanying article on GeeksforGeeks: <a href="https://www.geeksforgeeks.org/find-maximum-subset-xor-given-set/">https://www.geeksforgeeks.org/find-maximum-subset-xor-given-set/</a>

Maximum subset XOR | DSA Problem

Welcome to our algorithm tutorial where we explore how to add two numbers without using arithmetic operators! Whether you're a problem-solving enthusiast or a programmer seeking creative solutions, this tutorial is tailored for you.In this tutorial, we'll delve into the intriguing challenge of adding two numbers using bitwise operations and logical manipulation instead of traditional arithmetic operators. We'll provide a step-by-step explanation of the approach and guide you through the implementation in your preferred programming language.Join us as we dissect the problem and explore various strategies to achieve addition without arithmetic operators. From bitwise manipulation to logical operations, we'll cover different techniques and discuss their efficiency and applicability in different scenarios.Ready to enhance your algorithmic skills and think outside the box? Watch the tutorial now and unlock the secrets to adding numbers without arithmetic operators! For further exploration and detailed insights, don't forget to peruse the accompanying article on GeeksforGeeks: <a href="https://www.geeksforgeeks.org/add-two-numbers-without-using-arithmetic-operators/">https://www.geeksforgeeks.org/add-two-numbers-without-using-arithmetic-operators/</a>Don't miss out on the opportunity to expand your problem-solving repertoire and explore innovative approaches to algorithmic challenges. Like, share, and subscribe for more tutorials and insights into algorithmic problem-solving. Let's embark on this coding journey together. Happy coding!

Adding two numbers without using arithmetic operators | Bit Algorithms in Data Structures and Algorithms (DSA)

Given two non-negative integers a and b. The problem is to check if one of the two numbers is 1’s complement of the other.&nbsp; The ones’ complement of a binary number is defined as the value obtained by inverting all the bits in the binary representation of the number (swapping 0s for 1s and vice versa).Examples:Input : a = 10, b = 5 Output : Yes (10)10 = (1010)2 1's complement of 10 is = (0101)2 = (101)2 = (5)10&nbsp;Check if one of the numbers is one’s complement of the other &nbsp;: <a href="https://www.geeksforgeeks.org/check-one-numbers-ones-complement/">https://www.geeksforgeeks.org/check-one-numbers-ones-complement/</a>

Check if one of the numbers is one’s complement of the other

Given the sum and xor of two numbers X and Y s.t. sum and xor \in [0, 2^{64}-1] &nbsp; &nbsp;, we need to find the numbers minimizing the value of X A simple solution is to generate all possible pairs with given XOR. To generate all pairs, we can follow below rules.If X[i] is 1, then both a[i] and b[i] should be different, we have two cases. If X[i] is 0, then both a[i] and b[i] should be same. we have two cases. If X[i] = 0 and A[i] = 0, then a[i] = b[i] = 0. Only one possibility for this bit. If X[i] = 0 and A[i] = 1, then a[i] = b[i] = 1. Only one possibility for this bit. If X[i] = 1 and A[i] = 0, then (a[i] = 1 and b[i] = 0) or (a[i] = 0 and b[i] = 1), we can pick any of the two. If X[i] = 1 and A[i] = 1, result not possible (Note X[i] = 1 means different bits) Find two numbers from their sum and XOR : <a href="https://www.geeksforgeeks.org/find-two-numbers-sum-xor/">https://www.geeksforgeeks.org/find-two-numbers-sum-xor/</a>

Find two numbers from their sum and XOR

Given two signed integers, write a function that returns true if the signs of given integers are different, otherwise false. For example, the function should return true -1 and +100, and should return false for -100 and -200. The function should not use any of the arithmetic operators.&nbsp; Let the given integers be x and y. The sign bit is 1 in negative numbers, and 0 in positive numbers. The XOR of x and y will have the sign bit as 1 iff they have opposite sign. In other words, XOR of x and y will be negative number number iff x and y have opposite signs. The following code use this logic.&nbsp; &nbsp;Detect if two integers have opposite signs (Dynamic Programming) : <a href="https://www.geeksforgeeks.org/detect-if-two-integers-have-opposite-signs/">https://www.geeksforgeeks.org/detect-if-two-integers-have-opposite-signs/</a>

Detect if two integers have opposite signs (Dynamic Programming)

Given two signed integers, write a function that returns true if the signs of given integers are different, otherwise false. For example, the function should return true -1 and +100, and should return false for -100 and -200. The function should not use any of the arithmetic operators.&nbsp; Let the given integers be x and y. The sign bit is 1 in negative numbers, and 0 in positive numbers. The XOR of x and y will have the sign bit as 1 iff they have opposite sign. In other words, XOR of x and y will be negative number number iff x and y have opposite signs. Detect if two integers have opposite signs (Bitwise Algorithms) : <a href="https://www.geeksforgeeks.org/detect-if-two-integers-have-opposite-signs/">https://www.geeksforgeeks.org/detect-if-two-integers-have-opposite-signs/</a>

Detect if two integers have opposite signs (Bitwise Algorithms)

The naïve approach to solve the problem would be to first convert the given number into its binary representation and then change every 1’s to 0 and 0’s to 1. After changing all 0’s and 1’s convert the binary representation to number. Input &nbsp;: n = 5 Output : 2Input &nbsp;: n = 255 Output : 0Input &nbsp;: n = 26 Output : 5 Find One’s Complement of an Integer : <a href="https://www.geeksforgeeks.org/find-ones-complement-integer/">https://www.geeksforgeeks.org/find-ones-complement-integer/</a>

Find One’s Complement of an Integer

Given a number, the task is to find XOR of count of 0s and count of 1s in binary representation of a given number.&nbsp; Examples:&nbsp; &nbsp;Input &nbsp;: 5 Output : 3 Binary representation : 101 Count of 0s = 1,&nbsp; Count of 1s = 2 1 XOR 2 = 3.&nbsp;XOR counts of 0s and 1s in binary representation :<a href=" https://www.geeksforgeeks.org/xor-counts-0s-1s-binary-representation/"> https://www.geeksforgeeks.org/xor-counts-0s-1s-binary-representation/</a>

XOR counts of 0s and 1s in binary representation

1. ixor() :- This function is used to assign and xor the current value. This operation does “a^ = b” operation. Assigning is not performed in case of immutable containers, such as strings, numbers and tuples.2. ipow() :- This function is used to assign and exponentiate the current value. This operation does “a ** = b” operation. Assigning is not performed in case of immutable containers, such as strings, numbers and tuples.3. iand() :- This function is used to assign and bitwise and the current value. This operation does “a &amp;= b” operation. Assigning is not performed in case of immutable containers, such as strings, numbers and tuples.4. ior() :- This function is used to assign and bitwise or the current value. This operation does “a |=b ” operation. Assigning is not performed in case of immutable containers, such as strings, numbers and tuples. Inplace Operators - Part 2 : <a href="https://www.geeksforgeeks.org/inplace-operators-in-python-set-2ixor-iand-ipow/">https://www.geeksforgeeks.org/inplace-operators-in-python-set-2ixor-iand-ipow/</a>

Pyhton  Inplace Operators - Part 2

Given a positive integer n, find count of positive integers i such that 0 &lt;= i &lt;= n and n+i = n^iExamples :Input &nbsp;: n = 7 Output : 1 Explanation: 7^i = 7+i holds only for only for i = 0 7+0 = 7^0 = 7 Equal Sum and XOR : <a href="https://www.geeksforgeeks.org/equal-sum-xor/">https://www.geeksforgeeks.org/equal-sum-xor/</a>

Equal Sum and XOR

Practice Problems

JavaScript

Linux