Sunbelt Computer Software

PL/B Language Development and Support

GitHub - saidrishya/geeksforgeeks-solutions: programs from geeksforgeeks sudoplacement course. The language used is c++. For every problem, the problem statement with input and expected output has been provided, except for some where the driver code was already provided in the editor · GitHub

Branches Tags

Name	Name	Last commit message	Last commit date
Latest commit History 307 Commits
find the closest pair given from two arrays#include <bits	find the closest pair given from two arrays#include <bits
Check if a number is power of another number	Check if a number is power of another number
Check if array contains contiguous integers with duplicates allowed	Check if array contains contiguous integers with duplicates allowed
Check if edit distance between two strings is one	Check if edit distance between two strings is one
Chocolate Distribution Problem	Chocolate Distribution Problem
Find sum of different corresponding bits for all pairs	Find sum of different corresponding bits for all pairs
Find the fine	Find the fine
Given an unsigned integer N. The task is to swap all odd bits with even bits. For example, if the given number is 23 (00010111), it should be converted to 43(00101011). Here, every even position bit is swapped with adjacent bit on right side(even position bits are highlighted in binary representation of 23), and every odd position bit is swapped with adjacent on left side. Input: The first line of input contains T, denoting the number of testcases. Each testcase contains single line. Output: For each testcase in new line, print the converted number. Constraints: 1 ≤ T ≤ 100 1 ≤ N ≤ 100 Example: Input: 2 23 2 Output: 43 1 Explanation: Testcase 1: BInary representation of the given number; 00010111 after swapping 00101011.	Given an unsigned integer N. The task is to swap all odd bits with even bits. For example, if the given number is 23 (00010111), it should be converted to 43(00101011). Here, every even position bit is swapped with adjacent bit on right side(even position bits are highlighted in binary representation of 23), and every odd position bit is swapped with adjacent on left side. Input: The first line of input contains T, denoting the number of testcases. Each testcase contains single line. Output: For each testcase in new line, print the converted number. Constraints: 1 ≤ T ≤ 100 1 ≤ N ≤ 100 Example: Input: 2 23 2 Output: 43 1 Explanation: Testcase 1: BInary representation of the given number; 00010111 after swapping 00101011.
Immediate Smaller Element	Immediate Smaller Element
Intersection point in y shaped linked lists	Intersection point in y shaped linked lists
Number Of Open Doors	Number Of Open Doors
Print Bracket Number	Print Bracket Number
Print an array in Pendulum Arrangement	Print an array in Pendulum Arrangement
Reverse Array in groups	Reverse Array in groups
Sum of f(a[i], a[j]) over all pairs in an array of n integers	Sum of f(a[i], a[j]) over all pairs in an array of n integers
Type of array	Type of array
absolute difference of 1	absolute difference of 1
alone in a couple	alone in a couple
anagram	anagram
ancestors in a binary tree	ancestors in a binary tree
array in zig-zag fashion	array in zig-zag fashion
array pair divisibility problem	array pair divisibility problem
array subset of another array	array subset of another array
array to bst	array to bst
arya's long string	arya's long string
bfs	bfs
binary heap opereations	binary heap opereations
binary representation of a number	binary representation of a number
binary string	binary string
bleak numbers	bleak numbers
bottom view of a binary tree	bottom view of a binary tree
boundary traversal of binary tree	boundary traversal of binary tree
celebrity problem	celebrity problem
check if a binary tree is a full binary tree or not	check if a binary tree is a full binary tree or not
check if a number is fibonacci	check if a number is fibonacci
check if a string is isogram or not	check if a string is isogram or not
check if binary tree is balanced or not	check if binary tree is balanced or not
check if integer is power of 8 or not	check if integer is power of 8 or not
check if linked list is palindrome	check if linked list is palindrome
check if string is rotated by two places	check if string is rotated by two places
check if subtree	check if subtree
check if tree is isomorphic	check if tree is isomorphic
check if two arrays are equal or not	check if two arrays are equal or not
check if two strings are rotation of each other or not	check if two strings are rotation of each other or not
check mirror in n-ary tree	check mirror in n-ary tree
check whether kth bit is set bit or not	check whether kth bit is set bit or not
children parent sum	children parent sum
chinky and diamonds	chinky and diamonds
circular linked list traversal	circular linked list traversal
connect nodes at same level	connect nodes at same level
consecutive ones not allowed	consecutive ones not allowed
construct binary tree from the parent tree	construct binary tree from the parent tree
construct expression tree	construct expression tree
construct tree from inorder and preorder	construct tree from inorder and preorder
count bst nodes that lie in a given range	count bst nodes that lie in a given range
count distinct pairs with difference of k	count distinct pairs with difference of k
count elements	count elements
count leaf nodes non-recursive	count leaf nodes non-recursive
count leaf nodes recursive	count leaf nodes recursive
count total set bits	count total set bits
counting number of subtrees with given sum	counting number of subtrees with given sum
decimal equivalent of binary linked list	decimal equivalent of binary linked list
delete alternate nodes in linked list	delete alternate nodes in linked list
delete middle element of linked list	delete middle element of linked list
delete node in doubly linked list	delete node in doubly linked list
deletion in binary tree	deletion in binary tree
determine if two trees are identical	determine if two trees are identical
dfs	dfs
diagonal sum in binary tree	diagonal sum in binary tree
diagonal traversal of binary tree	diagonal traversal of binary tree
diameter of binary tree	diameter of binary tree
does array represent heap	does array represent heap
element with left side smaller and right side greater	element with left side smaller and right side greater
elements in the rage	elements in the rage
even fibonacci numbers sum	even fibonacci numbers sum
excel sheet part i	excel sheet part i
excel sheet part ii	excel sheet part ii
expression tree	expression tree
factorials of large numbers	factorials of large numbers
find all four sum numbers	find all four sum numbers
find common elements	find common elements
find duplicates in array	find duplicates in array
find element in sorted array whose frequency is >= half of n	find element in sorted array whose frequency is >= half of n
find element that appears once in sorted array	find element that appears once in sorted array
find first set bit	find first set bit
find fractional node	find fractional node
find height of binary tree given parent array	find height of binary tree given parent array
find height of binary tree non-recursive	find height of binary tree non-recursive
find height of generic tree represented by parent array	find height of generic tree represented by parent array
find k elements that are most frequent	find k elements that are most frequent
find middle element in linked list	find middle element in linked list
find missing and repeating	find missing and repeating
find most frequent element in array	find most frequent element in array
find smallest and second smallest element in array	find smallest and second smallest element in array
find sum of last n nodes in linked list	find sum of last n nodes in linked list
find the closest pair from two arrays	find the closest pair from two arrays
find the length of loop	find the length of loop
find the odd occurence	find the odd occurence
find triplets with sum 0	find triplets with sum 0
finding the numbers	finding the numbers

About

programs from geeksforgeeks sudoplacement course. The language used is c++. For every problem, the problem statement with input and expected output has been provided, except for some where the driver code was already provided in the editor

cpp competitive-programming geeksforgeeks-solutions must-do

Activity

48 stars

1 watching

22 forks

Report repository

Sunbelt Computer Software

PL/B Language Development and Support

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

About

Uh oh!

Releases

Packages

Uh oh!

Contributors

Uh oh!

Sunbelt Computer Software

PL/B Language Development and Support

Folders and files

Latest commit

History

About

Topics

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Contributors

Uh oh!

Packages