450 DSA Cracker Solutions

• 450 DSA Cracker is a comprehensive list of 400 + topic wise questions to build your confidence in data structure and algorithms and prepare yourself for placements.
• This WIP repository will contain solutions to all 450 questions prepared by Love Babbar in his competitve coding sheet solved in Java. Download the question sheet here.

Array

Sl. No	Question	Solution
01	Reverse an array or string	ReverseArray.java
02	Find the maximum and minimum element in an array	GetMinMax.java
03	Find the "Kth" max and min element of an array	KthMin.java
04	Given an array which consists of only 0, 1 and 2. Sort the array without using any sorting algo	Sort012.java
05	Move all the negative elements to one side of the array	NegativePostive.java
06	Find the Union & Intersection of two Sorted Arrays	UnionIntersection.java
07	Cyclically Rotate an array	ArrayRotation.java
08	Find Largest sum contiguous Subarray	MaxSumSubarray.java
09	Minimize the maximum difference between Heights	MinimizeHeightsDiff.java
10	Minimum no. of Jumps to reach the end of the array	MinimumJumps.java
11	Find duplicate in an array of N+1 integers	FindDuplicate.java
12	Merge two sorted arrays without using Extra Space	MergeSortedWithoutExtraSpace.java
13	Kadane's Algorithm	MaxSumSubarray.java
14	Merge Overlapping Intervals	MergeIntervals.java
15	Next Permutation	NextPermutation.java
16	Count Inversions	CountInversions.java
17	Best time to buy & sell stock	StockBuySell.java
21	Find if there is any subarray with sum equal to 0	SubarraySumZero.java
22	Factorial of large numbers	LargeFactorial.java
29	Trapping Rainwater Problem	TrappingRainwater.java

Matrix

Sl. No	Question	Solution
01	Given a matrix mat[][] of size M*N. Traverse and print the matrix in spiral form.	SpiralTraversal.java
02	Search an element in a matrix	SearchEle.java

String

Sl. No	Question	Solution
01	Reverse a string	ReverseString.java
02	Check whether a String is Palindrome or not	Palindrome.java
03	Find Duplicate characters in a string	CountDuplicates.java
04	Check whether a string is a valid shuffle of two strings or not	InterleavingOfCommon.java
05	Count and Say Problem	CountAndSay.java

Bit Manipulation

Sl. No	Question	Solution
01	Count set bits in an Integer	SetBitsCount.java
02	Find the two non-repeating elements in an array of repeating elements	NonRepeatingNo.java
03	Count number of bits to be flipped to convert A to B	BitDifference.java
04	Count total set bits in all numbers from 1 to n	SetBitsUptoN.java
05	Program to find whether is no. is Power of 2	PowerOf2.java
06	Find position of the only set bit	PositionOfSetBit.java
07	Copy set bits in a range	CopySetBitsRange.java
08	Divide two integers without using multiplication, division and mod operator	DivideWithoutOperator.java