https://github.com/akash-goyal-github/codewithakash
Daily :star: CodeWithAkash :star: is an initiative to do daily coding. The daily code started on 24 May 2021 :technologist: . Selected Most Important questions :100: will be uploaded here with optimized solutions in the coming time. If one practices these questions then he/she will be ready to crack any big company. :boom: :100: Give us a :star: if you like the initiative.
https://github.com/akash-goyal-github/codewithakash
advanced-data-structures arrays beginner-code code competitive-programming daily-coding-problem data-structures dinamic-programming dsa-algorithm geeksforgeeks geeksforgeeks-solutions gfg gfg-solutions graph java leetcode leetcode-solutions optimized-solution problem-solving string
Last synced: 24 days ago
JSON representation
Daily :star: CodeWithAkash :star: is an initiative to do daily coding. The daily code started on 24 May 2021 :technologist: . Selected Most Important questions :100: will be uploaded here with optimized solutions in the coming time. If one practices these questions then he/she will be ready to crack any big company. :boom: :100: Give us a :star: if you like the initiative.
- Host: GitHub
- URL: https://github.com/akash-goyal-github/codewithakash
- Owner: Akash-goyal-github
- Created: 2021-05-24T16:31:19.000Z (about 4 years ago)
- Default Branch: main
- Last Pushed: 2021-08-30T08:01:20.000Z (almost 4 years ago)
- Last Synced: 2025-04-16T02:12:45.566Z (3 months ago)
- Topics: advanced-data-structures, arrays, beginner-code, code, competitive-programming, daily-coding-problem, data-structures, dinamic-programming, dsa-algorithm, geeksforgeeks, geeksforgeeks-solutions, gfg, gfg-solutions, graph, java, leetcode, leetcode-solutions, optimized-solution, problem-solving, string
- Language: Java
- Homepage: https://github.com/Akash-goyal-github/CodeWithAkash
- Size: 393 KB
- Stars: 6
- Watchers: 1
- Forks: 3
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
:100: :boom: Daily codeWithAkash :boom::100:
---
# Topics :sunglasses:
---
:white_check_mark: [Arrays](#arrays) ![]()
:white_check_mark: [Matrix](#matrix)
:white_check_mark: [String](#string) ![]()
:white_check_mark: [Bit Manipulation](#Bit-Manipulation)
:white_check_mark: [Searching & Sorting](#Searching-Sorting) ![]()
:white_check_mark: [Linked List](#Linked-List)
---
# [Arrays](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays)
|Day|Problem|Solution Link|Difficulty|
|:----:|:---:|:---:|:---:|
|[D-1](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-1)|[Reverse the array](https://practice.geeksforgeeks.org/problems/reverse-an-array/0)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-1/Problem-1.java|Beginner|
|[D-1](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-1)|[Find minimum and maximum element in an array](https://practice.geeksforgeeks.org/problems/find-minimum-and-maximum-element-in-an-array4428/1#)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-1/Problem-2.java|Beginner|
|[D-1](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-1)|[Kth smallest element](https://practice.geeksforgeeks.org/problems/kth-smallest-element5635/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/Day-1/Problem-3.java|Beginner|
|[D-1](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-1)|[Sort an array of 0s, 1s and 2s](https://practice.geeksforgeeks.org/problems/sort-an-array-of-0s-1s-and-2s4231/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-1/Problem-4.java|Beginner|
|[D-1](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-1)|[Move all negative elements to end](https://practice.geeksforgeeks.org/problems/move-all-negative-elements-to-end1813/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-1/Problem-5.java|Beginner|
|[D-2](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-2)|[Union of two arrays](https://practice.geeksforgeeks.org/problems/union-of-two-arrays3538/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-2/Problem-1.java|Beginner|
|[D-2](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-2)|[Cyclically rotate an array by one](https://practice.geeksforgeeks.org/problems/cyclically-rotate-an-array-by-one2614/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-2/Problem-2.java|Beginner|
|[D-2](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-2)|[Find Largest contiguous Subarray](https://practice.geeksforgeeks.org/problems/kadanes-algorithm-1587115620/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-2/Problem-3.java|Medium***|
|[D-3](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-3)|[Minimize the Heights I](https://practice.geeksforgeeks.org/problems/minimize-the-heights-i/1/)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-3/Problem-1.java|Advanced|
|[D-3](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-3)|[Minimize the Heights II](https://practice.geeksforgeeks.org/problems/minimize-the-heights3351/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-3/Problem-2.java|Advanced***|
|[D-3](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-3)|[Minimum number of jumps](https://practice.geeksforgeeks.org/problems/minimum-number-of-jumps-1587115620/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-3/Problem-3.java|Medium***|
|[D-4](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-4)|[Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-4/Problem-1.java|Medium***|
|[D-4](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-4)|[Merge 2 sorted Array without Using extra space](https://practice.geeksforgeeks.org/problems/merge-two-sorted-arrays5135/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/Day-4/Problem-2.java|Medium***|
|[D-4](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-4)|[Kadane's Algorithm](https://practice.geeksforgeeks.org/problems/kadanes-algorithm-1587115620/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-4/Problem-3.java|Medium***|
|[D-5](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-5)|[Merge Intervals](https://leetcode.com/problems/merge-intervals/)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-5/Problem-1.java|Medium|
|[D-5](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-5)|[Next Permutation](https://leetcode.com/problems/next-permutation/)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-5/Problem-2.java|Medium***|
|[D-5](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-5)|[Count Inversion](https://practice.geeksforgeeks.org/problems/inversion-of-array/0)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-5/Problem-3.java|Advanced|
|[D-6](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-6)|[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-6/Problem-1.java|Beginner|
|[D-6](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-6)|[Count pairs with given sum](https://practice.geeksforgeeks.org/problems/count-pairs-with-given-sum5022/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-6/Problem-2.java|Medium***|
|[D-6](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-6)|[Common elements](https://practice.geeksforgeeks.org/problems/common-elements1132/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-6/Problem-3.java|Easy|
|[D-7](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-7)|[Rearrange the array in alternating positive and negative items with O(1) extra space](https://practice.geeksforgeeks.org/problems/array-of-alternate-ve-and-ve-nos1401/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-7/Problem-1.java|Medium|
|[D-7](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-7)|[Subarray with 0 sum](https://practice.geeksforgeeks.org/problems/subarray-with-0-sum/0)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-7/Problem-2.java|Medium***|
|[D-7](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-7)|[Find factorial of a large number](https://practice.geeksforgeeks.org/problems/factorials-of-large-numbers2508/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-7/Problem-3.java|Medium***|
|[D-8](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-8)|[find maximum product subarray](https://practice.geeksforgeeks.org/problems/maximum-product-subarray3604/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-8/Problem-1.java|Medium***|
|[D-8](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-8)|[Longest consecutive subsequence](https://practice.geeksforgeeks.org/problems/longest-consecutive-subsequence2449/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-8/Problem-2.java|Medium***|
|[D-8](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-8)|[Given an array of size n and a number k, find all elements that appear more than " n/k " times](https://practice.geeksforgeeks.org/problems/count-element-occurences/1#)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-8/Problem-3.java|Beginner***|
|[D-9](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-9)|[Maximum Profit](https://practice.geeksforgeeks.org/problems/maximum-profit4657/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-9/Problem-1.java|Medium***|
|[D-9](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-9)|[Array Subset of another array](https://practice.geeksforgeeks.org/problems/array-subset-of-another-array2317/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-9/Problem-2.java|Beginner|
|[D-9](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-9)|[Triplet Sum in Array](https://practice.geeksforgeeks.org/problems/triplet-sum-in-array-1587115621/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-9/Problem-3.java|Medium***|
|[D-10](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-10)|[Trapping Rain Water](https://practice.geeksforgeeks.org/problems/trapping-rain-water/0)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-10/Problem-1.java|Medium***|
|[D-10](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-10)|[Chocolate Distribution Problem](https://practice.geeksforgeeks.org/problems/chocolate-distribution-problem3825/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-10/Problem-2.java|Beginner|
|[D-10](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-10)|[Smallest subarray with sum greater than x ](https://practice.geeksforgeeks.org/problems/smallest-subarray-with-sum-greater-than-x5651/1)|https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-10/Problem-3.java|Medium***|
|[D-11](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-11)|[Three way partitioning](https://practice.geeksforgeeks.org/problems/three-way-partitioning/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-11/Problem-1.java|Medium***|
|[D-11](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-11)|[Minimum swaps and K together ](https://practice.geeksforgeeks.org/problems/minimum-swaps-required-to-bring-all-elements-less-than-or-equal-to-k-together/0)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-11/Problem-2.java|Medium***|
|[D-11](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-11)|[Palindromic Array](https://practice.geeksforgeeks.org/problems/palindromic-array/0)|https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-11/Problem-3.java|Beginner|
|[D-12](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-12)|[Find the median](https://practice.geeksforgeeks.org/problems/find-the-median0527/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-12/Problem-1.java|Medium***|
|[D-12](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/1.%20Arrays/Day-12)|[Median of 2 Sorted Arrays of Different Sizes](https://practice.geeksforgeeks.org/problems/median-of-2-sorted-arrays-of-different-sizes/0/)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/1.%20Arrays/Day-12/Problem-2.java|Advanced***|
|![]()
|![]()
|![]()
|![]()
|
### ![]()
[Top](#top) :top:
---
# [Matrix](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/2.%20Matrix)
|Day|Problem|Solution Link|Difficulty|
|:----:|:---:|:---:|:---:|
|[D-1](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/2.%20Matrix/Day-1)|[Spirally traversing a matrix](https://practice.geeksforgeeks.org/problems/spirally-traversing-a-matrix-1587115621/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/2.%20Matrix/Day-1/Problem-1.java|Medium***|
|[D-1](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/2.%20Matrix/Day-1)|[Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/2.%20Matrix/Day-1/Problem-2.java|Easy***|
|[D-1](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/2.%20Matrix/Day-1)|[Median in a row-wise sorted Matrix](https://practice.geeksforgeeks.org/problems/median-in-a-row-wise-sorted-matrix1527/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/2.%20Matrix/Day-1/Problem-3.java|Medium***|
|[D-2](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/2.%20Matrix/Day-2)|[Row with max 1s](https://practice.geeksforgeeks.org/problems/row-with-max-1s0023/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/2.%20Matrix/Day-2/Problem-1.java|Easy***|
|[D-2](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/2.%20Matrix/Day-2)|[Print elements in sorted order using row-column wise sorted matrix](https://practice.geeksforgeeks.org/problems/sorted-matrix/0)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/2.%20Matrix/Day-2/Problem-2.java|Easy***|
|[D-2](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/2.%20Matrix/Day-2)|[Maximum size rectangle](https://practice.geeksforgeeks.org/problems/max-rectangle/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/2.%20Matrix/Day-2/Problem-3.java|Medium***|
|[D-3](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/2.%20Matrix/Day-3)|[Find a specific pair in matrix](https://www.codingninjas.com/codestudio/problems/find-max-difference_893356)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/2.%20Matrix/Day-3/Problem-1.java|Medium***|
|[D-3](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/2.%20Matrix/Day-3)|[Rotate matrix by 90 degrees](https://practice.geeksforgeeks.org/problems/rotate-by-90-degree-1587115621/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/2.%20Matrix/Day-3/Problem-2.java|Medium***|
|[D-4](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/2.%20Matrix/Day-4)|[Kth smallest element in a row-cpumn wise sorted matrix](https://practice.geeksforgeeks.org/problems/kth-element-in-matrix/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/2.%20Matrix/Day-4/Problem-1.java|Medium***|
|[D-4](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/2.%20Matrix/Day-4)|[Common elements in all rows of a given matrix](https://www.codingninjas.com/codestudio/problems/common-elements-present-in-all-rows-of-a-matrix_1118111)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/2.%20Matrix/Day-4/Problem-2.java|Easy***|
|![]()
|![]()
|![]()
|![]()
|
### ![]()
[Top](#top) :top:
---
# [String](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/3.%20String)
|Day|Problem|Solution Link|Difficulty|
|:----:|:---:|:---:|:---:|
|[D-1](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/3.%20String/Day-1)|[Reverse a String](https://leetcode.com/problems/reverse-string/)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/3.%20String/Day-1/Problem-1.java|Beginner|
|[D-1](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/3.%20String/Day-1)|[Check whether a String is Palindrome or not](https://practice.geeksforgeeks.org/problems/palindrome-string0817/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/3.%20String/Day-1/Problem-2.java|Beginner|
|[D-1](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/3.%20String/Day-1)|[Print all the duplicates in the input string](https://www.geeksforgeeks.org/print-all-the-duplicates-in-the-input-string/)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/3.%20String/Day-1/Problem-3.java|Beginner***|
|[D-2](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/3.%20String/Day-2)|[First Repeated Character in a string](https://practice.geeksforgeeks.org/problems/repeated-character2058/1#)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/3.%20String/Day-2/Problem-1.java|Beginner***|
|[D-2](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/3.%20String/Day-2)|[Write a Code to check whether one string is a rotation of another](https://practice.geeksforgeeks.org/problems/check-if-strings-are-rotations-of-each-other-or-not-1587115620/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/3.%20String/Day-2/Problem-2.java|Easy***|
|[D-2](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/3.%20String/Day-2)|[Write a Program to check whether a string is a valid shuffle of two strings or not](https://leetcode.com/problems/interleaving-string/)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/3.%20String/Day-2/Problem-3.java|Advanced***|
|[D-3](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/3.%20String/Day-3)|[Count and Say](https://leetcode.com/problems/count-and-say/)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/3.%20String/Day-3/Problem-1.java|Easy***|
|![]()
|![]()
|![]()
|![]()
|
### ![]()
[Top](#top) :top:
---
# [Bit-Manipulation](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/4.%20Bit%20Manupulation)
|Day|Problem|Solution Link|Difficulty|
|:----:|:---:|:---:|:---:|
|[D-1](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-1)|[Count set bits in an integer](https://practice.geeksforgeeks.org/problems/set-bits0143/1)|https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-1/Problem-1.java|Easy|
|[D-1](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-1)|[Find the two non-repeating elements in an array of repeating elements](https://practice.geeksforgeeks.org/problems/finding-the-numbers0215/1)|https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-1/Problem-2.java|Medium***|
|[D-1](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-1)|[Count number of bits to be flipped to convert A to B](https://practice.geeksforgeeks.org/problems/bit-difference/0)|https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-1/Problem-3.java|Easy|
|[D-2](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-2)|[Count total set bits in all numbers from 1 to n](https://practice.geeksforgeeks.org/problems/count-total-set-bits/0)|https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-2/Problem-1.java|Medium***|
|[D-2](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-2)|[Power of 2](https://practice.geeksforgeeks.org/problems/power-of-2-1587115620/1)|https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-2/Problem-2.java|Easy|
|[D-2](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-2)|[Find position of the only set bit](https://practice.geeksforgeeks.org/problems/find-position-of-set-bit3706/1)|https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-2/Problem-3.java|Easy|
|[D-3](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-3)|[Copy set bits in a range](https://practice.geeksforgeeks.org/problems/copy-set-bits-in-range0623/1)|https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-3/Problem-1.java|Advanced***|
|[D-3](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-3)|[Divide two integers without using multiplication, division and mod operator](https://practice.geeksforgeeks.org/problems/division-without-using-multiplication-division-and-mod-operator/0/#)|https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-3/Problem-1.java|Advanced***|
|[D-4](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-4)|[Calculate square of a number without using *, / and pow()](https://www.codingninjas.com/codestudio/problems/calculate-square-of-a-number_1112623)|https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-3/Problem-1.java|Easy***|
|[D-4](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-4)|[Power Set](https://practice.geeksforgeeks.org/problems/power-set4302/1)|https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-3/Problem-1.java|Medium***|
|![]()
|![]()
|![]()
|![]()
|
### ![]()
[Top](#top) :top:
---
# [Searching-Sorting](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/5.%20Searching%20%26%20Sorting)
|Day|Problem|Solution Link|Difficulty|
|:----:|:---:|:---:|:---:|
|[D-1](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/5.%20Searching%20%26%20Sorting/Day-1)|[Find first and last positions of an element in a sorted array](https://practice.geeksforgeeks.org/problems/first-and-last-occurrences-of-x/0)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-1/Problem-1.java|Easy***|
|[D-1](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/5.%20Searching%20%26%20Sorting/Day-1)|[Find a Fixed Point (Value equal to index) in a given array](https://practice.geeksforgeeks.org/problems/value-equal-to-index-value1330/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-1/Problem-2.java|Easy|
|[D-1](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/5.%20Searching%20%26%20Sorting/Day-1)|[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-1/Problem-3.java|Medium***|
|[D-2](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/5.%20Searching%20%26%20Sorting/Day-2)|[square root of an integer](https://practice.geeksforgeeks.org/problems/count-squares3649/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-2/Problem-1.java|Easy|
|[D-2](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/5.%20Searching%20%26%20Sorting/Day-2)|[Maximum and minimum of an array using minimum number of comparisons](https://practice.geeksforgeeks.org/problems/middle-of-three2926/11)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-2/Problem-2.java|Easy*|
|[D-2](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/5.%20Searching%20%26%20Sorting/Day-2)|[Optimum location of point to minimize total distance](https://www.geeksforgeeks.org/optimum-location-point-minimize-total-distance/#)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-2/Problem-3.java|Advanced***|
|[D-3](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/5.%20Searching%20%26%20Sorting/Day-3)|[Find the repeating and the missing](https://practice.geeksforgeeks.org/problems/find-missing-and-repeating2512/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-3/Problem-1.java|Medium***|
|[D-3](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/5.%20Searching%20%26%20Sorting/Day-3)|[find majority element](https://practice.geeksforgeeks.org/problems/majority-element-1587115620/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-3/Problem-2.java|Easy***|
|[D-3](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/5.%20Searching%20%26%20Sorting/Day-3)|[Searching in an array where adjacent differ by at most k](https://practice.geeksforgeeks.org/problems/searching-in-an-array-where-adjacent-differ-by-at-most-k0456/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-3/Problem-3.java|Easy***|
|[D-4](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/5.%20Searching%20%26%20Sorting/Day-4)|[find a pair with a given difference](https://practice.geeksforgeeks.org/problems/find-pair-given-difference1559/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-4/Problem-1.java|Easy***|
|[D-4](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/5.%20Searching%20%26%20Sorting/Day-4)|[find four elements that sum to a given value](https://practice.geeksforgeeks.org/problems/find-all-four-sum-numbers1732/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-4/Problem-2.java|Advanced***|
|[D-4](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/5.%20Searching%20%26%20Sorting/Day-4)|[Stickler Thief (maximum sum such that no 2 elements are adjacent)](https://practice.geeksforgeeks.org/problems/stickler-theif-1587115621/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-4/Problem-3.java|Medium***|
|[D-5](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/5.%20Searching%20%26%20Sorting/Day-5)|[Count triplet with sum smaller than a given value](https://practice.geeksforgeeks.org/problems/count-triplets-with-sum-smaller-than-x5549/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-5/Problem-1.java|Easy***|
|[D-5](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/5.%20Searching%20%26%20Sorting/Day-5)|[merge 2 sorted arrays](https://practice.geeksforgeeks.org/problems/merge-two-sorted-arrays5135/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-5/Problem-2.java|Medium***|
|[D-5](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/5.%20Searching%20%26%20Sorting/Day-5)|[print all subarrays with 0 sum](https://practice.geeksforgeeks.org/problems/stickler-theif-1587115621/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-5/Problem-3.java|Medium***|
|[D-6](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/5.%20Searching%20%26%20Sorting/Day-6)|[Product array puzzle](https://practice.geeksforgeeks.org/problems/product-array-puzzle4525/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-6/Problem-1.java|Easy|
|![]()
|![]()
|![]()
|![]()
|
### ![]()
[Top](#top) :top:
---
# [Linked-List](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/6.%20Linked%20List)
|Day|Problem|Solution Link|Difficulty|
|:----:|:---:|:---:|:---:|
|[D-1](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/6.%20Linked%20List/Day-1)|[Write a Program to reverse the Linked List](https://practice.geeksforgeeks.org/problems/reverse-a-linked-list/1#)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/6.%20Linked%20List/Day-1/Problem-1.java|Medium***|
|[D-1](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/6.%20Linked%20List/Day-1)|[Reverse a Linked List in group of Given Size](https://practice.geeksforgeeks.org/problems/reverse-a-linked-list-in-groups-of-given-size/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/6.%20Linked%20List/Day-1/Problem-2.java|Advanced**|
|[D-1](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/6.%20Linked%20List/Day-1)|[Rotate a Linked List](https://practice.geeksforgeeks.org/problems/rotate-a-linked-list/1/)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/6.%20Linked%20List/Day-1/Problem-3.java|Medium***|
|[D-2](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/6.%20Linked%20List/Day-2)|[Detect Loop in linked list](https://practice.geeksforgeeks.org/problems/detect-loop-in-linked-list/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/6.%20Linked%20List/Day-2/Problem-1.java|Easy***|
|[D-2](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/6.%20Linked%20List/Day-2)|[Remove loop in Linked List](https://practice.geeksforgeeks.org/problems/remove-loop-in-linked-list/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/6.%20Linked%20List/Day-2/Problem-2.java|Advanced***|
|[D-2](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/6.%20Linked%20List/Day-2)|[Add two numbers represented by linked lists](https://practice.geeksforgeeks.org/problems/add-two-numbers-represented-by-linked-lists/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/6.%20Linked%20List/Day-2/Problem-3.java|Medium***|
|[D-3](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/6.%20Linked%20List/Day-3)|[Intersection Point in Y Shapped Linked Lists](https://practice.geeksforgeeks.org/problems/intersection-point-in-y-shapped-linked-lists/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/6.%20Linked%20List/Day-3/Problem-1.java|Easy***|
|[D-3](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/6.%20Linked%20List/Day-3)|[Pairwise swap elements of a linked list](https://practice.geeksforgeeks.org/problems/pairwise-swap-elements-of-a-linked-list-by-swapping-data/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/6.%20Linked%20List/Day-3/Problem-2.java|Medium***|
|[D-3](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/6.%20Linked%20List/Day-3)|[Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/6.%20Linked%20List/Day-3/Problem-3.java|Easy***|
|[D-3](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/6.%20Linked%20List/Day-3)|[Flatten a Linked List](https://practice.geeksforgeeks.org/problems/flattening-a-linked-list/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/6.%20Linked%20List/Day-3/Problem-4.java|Medium***|
|[D-4](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/6.%20Linked%20List/Day-4)|[Sort a LL of 0's, 1's and 2's](https://practice.geeksforgeeks.org/problems/given-a-linked-list-of-0s-1s-and-2s-sort-it/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/6.%20Linked%20List/Day-4/Problem-1.java|Easy***|
|[D-4](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/6.%20Linked%20List/Day-4)|[Nth node from end of linked list](https://practice.geeksforgeeks.org/problems/nth-node-from-end-of-linked-list/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/6.%20Linked%20List/Day-4/Problem-2.java|Easy***|
|[D-4](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/6.%20Linked%20List/Day-4)|[Implement Stack using Linked List](https://practice.geeksforgeeks.org/problems/implement-stack-using-linked-list/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/6.%20Linked%20List/Day-4/Problem-3.java|Medium***|
|[D-4](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/6.%20Linked%20List/Day-4)|[Merge two sorted Linked list](https://practice.geeksforgeeks.org/problems/merge-two-sorted-linked-lists/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/6.%20Linked%20List/Day-4/Problem-4.java|Easy***|
|[D-5](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/6.%20Linked%20List/Day-5)|[Implement Queue using Linked List](https://practice.geeksforgeeks.org/problems/implement-queue-using-linked-list/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/6.%20Linked%20List/Day-5/Problem-1.java|Medium***|
|[D-5](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/6.%20Linked%20List/Day-5)|[Delete without head pointer](https://practice.geeksforgeeks.org/problems/delete-without-head-pointer/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/6.%20Linked%20List/Day-5/Problem-2.java|Medium***|
|[D-5](https://github.com/Akash-goyal-github/CodeWithAkash/tree/main/6.%20Linked%20List/Day-5)|[Check if Linked List is Palindrome ](https://practice.geeksforgeeks.org/problems/check-if-linked-list-is-pallindrome/1)|https://github.com/Akash-goyal-github/CodeWithAkash/blob/main/6.%20Linked%20List/Day-5/Problem-3.java|Easy***|
|![]()
|![]()
|![]()
|![]()
|
### ![]()
[Top](#top) :top:
---