GitHub - BhavinOndhiya/Supreme-Batch: in these on every fridays saturday and sunday i would be posting problems solved during the live classes by love babbar

BhavinOndhiya / Supreme-Batch Public

Notifications You must be signed in to change notification settings
Fork 0
Star 2

in these on every fridays saturday and sunday i would be posting problems solved during the live classes by love babbar

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 107 Commits
.gitignore		.gitignore
2D Array Questions		2D Array Questions
3-Way Merge sort		3-Way Merge sort
4-Sum Problem		4-Sum Problem
Binary Search Questions		Binary Search Questions
Binary Search Using Recurrsion		Binary Search Using Recurrsion
Binary representation of next number		Binary representation of next number
Bitonic sort		Bitonic sort
Booth Algorithm		Booth Algorithm
Brick Sort		Brick Sort
Bubble Sort		Bubble Sort
Bucket Sort		Bucket Sort
Character , Array and Strings Questions		Character , Array and Strings Questions
Check if a string can be obtained by rotating another string 2 places		Check if a string can be obtained by rotating another string 2 places
Chocolate distribution		Chocolate distribution
Comb Sort		Comb Sort
Converting Sentence To Camel Case		Converting Sentence To Camel Case
Count Inversions		Count Inversions
Count Sort		Count Sort
Cycle Sort		Cycle Sort
Delete a node from Dobly linked list		Delete a node from Dobly linked list
Divisible by 7		Divisible by 7
Fibonacci Reccursive		Fibonacci Reccursive
Find Missing And Repeating		Find Missing And Repeating
Find i'th character in a binary string		Find i'th character in a binary string
Full Pyramid		Full Pyramid
Heap Sort		Heap Sort
Heap Sort for decreasing order using min heap		Heap Sort for decreasing order using min heap
Hollow Rectangle		Hollow Rectangle
Implementation of cycle sort		Implementation of cycle sort
Insert and Delete Operation in Linked List		Insert and Delete Operation in Linked List
Insertion Sort		Insertion Sort
Inverted Pyramid		Inverted Pyramid
Iterative Heap Sort		Iterative Heap Sort
Kadane's algorithm		Kadane's algorithm
LL Insertion		LL Insertion
Leaders in an Array		Leaders in an Array
Linear Search		Linear Search
Linked List		Linked List
Linked List operations		Linked List operations
Linked List part - 2		Linked List part - 2
Longest Common Prefix		Longest Common Prefix
Max Sum		Max Sum
Min and Max Element Using Recurrsion		Min and Max Element Using Recurrsion
Minimize the Heights II		Minimize the Heights II
Minimum Deletions		Minimum Deletions
N-Queen Problem		N-Queen Problem
Number of Segments		Number of Segments
OOPS		OOPS
Panagram or not		Panagram or not
Permutation Of String		Permutation Of String
Permutation sort		Permutation sort
Pointer 2		Pointer 2
Pointers Questions		Pointers Questions
Queue Reversal		Queue Reversal
Quick Sort		Quick Sort
Radix Sort		Radix Sort
Rat in a Maze		Rat in a Maze
Recursion Questions		Recursion Questions
Recursion Revising		Recursion Revising
STL		STL
Selection Sort		Selection Sort
Shell Sort		Shell Sort
Sleep Sort		Sleep Sort
Solid Diamond		Solid Diamond
Stack		Stack
String Predefined Functions		String Predefined Functions
Strings and Array		Strings and Array
Stroog Sort		Stroog Sort
Suduku Solver Code		Suduku Solver Code
Tim Sort		Tim Sort
To heapify a subtree rooted with node i which is an index in arr[]. n is size of heap		To heapify a subtree rooted with node i which is an index in arr[]. n is size of heap
Traversal of Circular Linked List		Traversal of Circular Linked List
Unique Number Of Occurences		Unique Number Of Occurences
connecting n ropes with minimum cost		connecting n ropes with minimum cost
count occurrences in a linked list		count occurrences in a linked list
count the number of pairs		count the number of pairs
delete N nodes after M nodes of a linked list		delete N nodes after M nodes of a linked list
find a pair with given sum x		find a pair with given sum x
find gcd		find gcd
find height of complete binary tree from total nodes		find height of complete binary tree from total nodes
find med in stream of running integers		find med in stream of running integers
find position to insert current element of stream using binary search		find position to insert current element of stream using binary search
find the K-th largest sum of subarray		find the K-th largest sum of subarray
function to find maximum distinct elements after removing k elements		function to find maximum distinct elements after removing k elements
function to find the kth non-repeating character		function to find the kth non-repeating character
generate smallest derangement using priority queue		generate smallest derangement using priority queue
hollow inverted half pyramid.cpp		hollow inverted half pyramid.cpp
implementation of largest triplet multiplication		implementation of largest triplet multiplication
implementation to find k numbers with most occurrences in the given array		implementation to find k numbers with most occurrences in the given array
k-ary Heap		k-ary Heap
pointers		pointers
print all values smaller than a given value in Binary heap		print all values smaller than a given value in Binary heap
print palindromic string		print palindromic string
recursive 1		recursive 1
reverse a linked list in groups		reverse a linked list in groups
reverse doubly linked list		reverse doubly linked list
subsequence		subsequence
vectors		vectors