Akash-goyal-/CodeWithAkash

BranchesTags

Repository files navigation


✅ Arrays ✅ Matrix

✅ String ✅ Bit Manipulation

✅ Searching & Sorting ✅ Linked List




DayProblemSolution LinkDifficulty
D-1Reverse the arrayhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-1/Problem-1.javaBeginner
D-1Find minimum and maximum element in an arrayhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-1/Problem-2.javaBeginner
D-1Kth smallest elementhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/Day-1/Problem-3.javaBeginner
D-1Sort an array of 0s, 1s and 2shttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-1/Problem-4.javaBeginner
D-1Move all negative elements to endhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-1/Problem-5.javaBeginner
D-2Union of two arrayshttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-2/Problem-1.javaBeginner
D-2Cyclically rotate an array by onehttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-2/Problem-2.javaBeginner
D-2Find Largest contiguous Subarrayhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-2/Problem-3.javaMedium***
D-3Minimize the Heights Ihttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-3/Problem-1.javaAdvanced
D-3Minimize the Heights IIhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-3/Problem-2.javaAdvanced***
D-3Minimum number of jumpshttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-3/Problem-3.javaMedium***
D-4Find the Duplicate Numberhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-4/Problem-1.javaMedium***
D-4Merge 2 sorted Array without Using extra spacehttps://.com/Akash-goyal-/CodeWithAkash/blob/main/Day-4/Problem-2.javaMedium***
D-4Kadane's Algorithmhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-4/Problem-3.javaMedium***
D-5Merge Intervalshttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-5/Problem-1.javaMedium
D-5Next Permutationhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-5/Problem-2.javaMedium***
D-5Count Inversionhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-5/Problem-3.javaAdvanced
D-6Best Time to Buy and Sell Stockhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-6/Problem-1.javaBeginner
D-6Count pairs with given sumhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-6/Problem-2.javaMedium***
D-6Common elementshttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-6/Problem-3.javaEasy
D-7Rearrange the array in alternating positive and negative items with O(1) extra spacehttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-7/Problem-1.javaMedium
D-7Subarray with 0 sumhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-7/Problem-2.javaMedium***
D-7Find factorial of a large numberhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-7/Problem-3.javaMedium***
D-8find maximum product subarrayhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-8/Problem-1.javaMedium***
D-8Longest consecutive subsequencehttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-8/Problem-2.javaMedium***
D-8Given an array of size n and a number k, find all elements that appear more than " n/k " timeshttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-8/Problem-3.javaBeginner***
D-9Maximum Profithttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-9/Problem-1.javaMedium***
D-9Array Subset of another arrayhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-9/Problem-2.javaBeginner
D-9Triplet Sum in Arrayhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-9/Problem-3.javaMedium***
D-10Trapping Rain Waterhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-10/Problem-1.javaMedium***
D-10Chocolate Distribution Problemhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-10/Problem-2.javaBeginner
D-10Smallest subarray with sum greater than xhttps://.com/Akash-goyal-/CodeWithAkash/tree/main/1.%20Arrays/Day-10/Problem-3.javaMedium***
D-11Three way partitioninghttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-11/Problem-1.javaMedium***
D-11Minimum swaps and K togetherhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-11/Problem-2.javaMedium***
D-11Palindromic Arrayhttps://.com/Akash-goyal-/CodeWithAkash/tree/main/1.%20Arrays/Day-11/Problem-3.javaBeginner
D-12Find the medianhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-12/Problem-1.javaMedium***
D-12Median of 2 Sorted Arrays of Different Sizeshttps://.com/Akash-goyal-/CodeWithAkash/blob/main/1.%20Arrays/Day-12/Problem-2.javaAdvanced***



DayProblemSolution LinkDifficulty
D-1Spirally traversing a matrixhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/2.%20Matrix/Day-1/Problem-1.javaMedium***
D-1Search a 2D Matrixhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/2.%20Matrix/Day-1/Problem-2.javaEasy***
D-1Median in a row-wise sorted Matrixhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/2.%20Matrix/Day-1/Problem-3.javaMedium***
D-2Row with max 1shttps://.com/Akash-goyal-/CodeWithAkash/blob/main/2.%20Matrix/Day-2/Problem-1.javaEasy***
D-2Print elements in sorted order using row-column wise sorted matrixhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/2.%20Matrix/Day-2/Problem-2.javaEasy***
D-2Maximum size rectanglehttps://.com/Akash-goyal-/CodeWithAkash/blob/main/2.%20Matrix/Day-2/Problem-3.javaMedium***
D-3Find a specific pair in matrixhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/2.%20Matrix/Day-3/Problem-1.javaMedium***
D-3Rotate matrix by 90 degreeshttps://.com/Akash-goyal-/CodeWithAkash/blob/main/2.%20Matrix/Day-3/Problem-2.javaMedium***
D-4Kth smallest element in a row-cpumn wise sorted matrixhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/2.%20Matrix/Day-4/Problem-1.javaMedium***
D-4Common elements in all rows of a given matrixhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/2.%20Matrix/Day-4/Problem-2.javaEasy***



DayProblemSolution LinkDifficulty
D-1Reverse a Stringhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/3.%20String/Day-1/Problem-1.javaBeginner
D-1Check whether a String is Palindrome or nothttps://.com/Akash-goyal-/CodeWithAkash/blob/main/3.%20String/Day-1/Problem-2.javaBeginner
D-1Print all the duplicates in the input stringhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/3.%20String/Day-1/Problem-3.javaBeginner***
D-2First Repeated Character in a stringhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/3.%20String/Day-2/Problem-1.javaBeginner***
D-2Write a Code to check whether one string is a rotation of anotherhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/3.%20String/Day-2/Problem-2.javaEasy***
D-2Write a Program to check whether a string is a valid shuffle of two strings or nothttps://.com/Akash-goyal-/CodeWithAkash/blob/main/3.%20String/Day-2/Problem-3.javaAdvanced***
D-3Count and Sayhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/3.%20String/Day-3/Problem-1.javaEasy***



DayProblemSolution LinkDifficulty
D-1Count set bits in an integerhttps://.com/Akash-goyal-/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-1/Problem-1.javaEasy
D-1Find the two non-repeating elements in an array of repeating elementshttps://.com/Akash-goyal-/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-1/Problem-2.javaMedium***
D-1Count number of bits to be flipped to convert A to Bhttps://.com/Akash-goyal-/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-1/Problem-3.javaEasy
D-2Count total set bits in all numbers from 1 to nhttps://.com/Akash-goyal-/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-2/Problem-1.javaMedium***
D-2Power of 2https://.com/Akash-goyal-/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-2/Problem-2.javaEasy
D-2Find position of the only set bithttps://.com/Akash-goyal-/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-2/Problem-3.javaEasy
D-3Copy set bits in a rangehttps://.com/Akash-goyal-/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-3/Problem-1.javaAdvanced***
D-3Divide two integers without using multiplication, division and mod operatorhttps://.com/Akash-goyal-/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-3/Problem-1.javaAdvanced***
D-4Calculate square of a number without using *, / and pow()https://.com/Akash-goyal-/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-3/Problem-1.javaEasy***
D-4Power Sethttps://.com/Akash-goyal-/CodeWithAkash/tree/main/4.%20Bit%20Manupulation/Day-3/Problem-1.javaMedium***



DayProblemSolution LinkDifficulty
D-1Find first and last positions of an element in a sorted arrayhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-1/Problem-1.javaEasy***
D-1Find a Fixed Point (Value equal to index) in a given arrayhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-1/Problem-2.javaEasy
D-1Search in Rotated Sorted Arrayhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-1/Problem-3.javaMedium***
D-2square root of an integerhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-2/Problem-1.javaEasy
D-2Maximum and minimum of an array using minimum number of comparisonshttps://.com/Akash-goyal-/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-2/Problem-2.javaEasy*
D-2Optimum location of point to minimize total distancehttps://.com/Akash-goyal-/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-2/Problem-3.javaAdvanced***
D-3Find the repeating and the missinghttps://.com/Akash-goyal-/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-3/Problem-1.javaMedium***
D-3find majority elementhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-3/Problem-2.javaEasy***
D-3Searching in an array where adjacent differ by at most khttps://.com/Akash-goyal-/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-3/Problem-3.javaEasy***
D-4find a pair with a given differencehttps://.com/Akash-goyal-/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-4/Problem-1.javaEasy***
D-4find four elements that sum to a given valuehttps://.com/Akash-goyal-/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-4/Problem-2.javaAdvanced***
D-4Stickler Thief (maximum sum such that no 2 elements are adjacent)https://.com/Akash-goyal-/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-4/Problem-3.javaMedium***
D-5Count triplet with sum smaller than a given valuehttps://.com/Akash-goyal-/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-5/Problem-1.javaEasy***
D-5merge 2 sorted arrayshttps://.com/Akash-goyal-/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-5/Problem-2.javaMedium***
D-5print all subarrays with 0 sumhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-5/Problem-3.javaMedium***
D-6Product array puzzlehttps://.com/Akash-goyal-/CodeWithAkash/blob/main/5.%20Searching%20%26%20Sorting/Day-6/Problem-1.javaEasy



DayProblemSolution LinkDifficulty
D-1Write a Program to reverse the Linked Listhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/6.%20Linked%20List/Day-1/Problem-1.javaMedium***
D-1Reverse a Linked List in group of Given Sizehttps://.com/Akash-goyal-/CodeWithAkash/blob/main/6.%20Linked%20List/Day-1/Problem-2.javaAdvanced**
D-1Rotate a Linked Listhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/6.%20Linked%20List/Day-1/Problem-3.javaMedium***
D-2Detect Loop in linked listhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/6.%20Linked%20List/Day-2/Problem-1.javaEasy***
D-2Remove loop in Linked Listhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/6.%20Linked%20List/Day-2/Problem-2.javaAdvanced***
D-2Add two numbers represented by linked listshttps://.com/Akash-goyal-/CodeWithAkash/blob/main/6.%20Linked%20List/Day-2/Problem-3.javaMedium***
D-3Intersection Point in Y Shapped Linked Listshttps://.com/Akash-goyal-/CodeWithAkash/blob/main/6.%20Linked%20List/Day-3/Problem-1.javaEasy***
D-3Pairwise swap elements of a linked listhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/6.%20Linked%20List/Day-3/Problem-2.javaMedium***
D-3Middle of the Linked Listhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/6.%20Linked%20List/Day-3/Problem-3.javaEasy***
D-3Flatten a Linked Listhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/6.%20Linked%20List/Day-3/Problem-4.javaMedium***
D-4Sort a LL of 0's, 1's and 2'shttps://.com/Akash-goyal-/CodeWithAkash/blob/main/6.%20Linked%20List/Day-4/Problem-1.javaEasy***
D-4Nth node from end of linked listhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/6.%20Linked%20List/Day-4/Problem-2.javaEasy***
D-4Implement Stack using Linked Listhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/6.%20Linked%20List/Day-4/Problem-3.javaMedium***
D-4Merge two sorted Linked listhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/6.%20Linked%20List/Day-4/Problem-4.javaEasy***
D-5Implement Queue using Linked Listhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/6.%20Linked%20List/Day-5/Problem-1.javaMedium***
D-5Delete without head pointerhttps://.com/Akash-goyal-/CodeWithAkash/blob/main/6.%20Linked%20List/Day-5/Problem-2.javaMedium***
D-5Check if Linked List is Palindromehttps://.com/Akash-goyal-/CodeWithAkash/blob/main/6.%20Linked%20List/Day-5/Problem-3.javaEasy***


About

Daily ⭐ CodeWithAkash ⭐ is an initiative to do daily coding. The daily code started on 24 May 2021 🧑‍💻 . Selected Most Important questions 💯 will be uploaded here with optimized solutions in the coming time. If one practices these questions then he/she will be ready to any big company. 💥 💯 Give us a ⭐ if you like the initiative.

.com/Akash-goyal-/CodeWithAkash

Topics

java leetcode graph string code competitive-programming data-structures geeksforgeeks arrays leetcode-solutions problem-solving beginner-code geeksforgeeks-solutions advanced-data-structures gfg daily-coding-problem dinamic-programming dsa-algorithm gfg-solutions optimized-solution

Resources

Readme
Activity

Stars

6 stars

Watchers

1 watching

Forks

3 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages