Skip to content

vyash5075/Core-Java-Programming-Practices

Repository files navigation

BYJi# Programming Practices License Build Status Language J If you like my content,........ Please, leave me a star.You can contribute as well..❤️.

- Yash Verma....
```.
U
<!--. . ## Algorithms

|  #  |      Title     |   Solutions   | Video  | Difficulty  |Level| Tag1           
|-----|--------------------|-------------------|--------|-------------|---|---------------
|1936|[Add Minimum Number of Rungs](https://leetcode.com/problems/add-minimum-number-of-rungs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1936.java) ||Medium||
|1935|[Maximum Number of Words You Can Type](https://leetcode.com/problems/maximum-number-of-words-you-can-type/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1935.java) ||Easy|String|
|1925|[Count Square Sum Triples](https://leetcode.com/problems/count-square-sum-triples/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1925.java) ||Easy|Array, Greedy||
|1897|[Redistribute Characters to Make All Strings Equal](https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1897.java) ||Easy|String,Greedy| -->

## Recursions q
|  #  |      Problem     |   Solutions   | Source  | Difficulty  |Level |  Tags         
|-----|------------------|------------------|--------|-------------|-|------------
|1    |[ Print in decreasing manner](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/printDecreasingIncreasing.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/printDecreasingIncreasing.java) |Pepcoding|Easy|Lv.1|Backtracking
|2    |[Print in Increasing  manner](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/printIncreasing.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/printIncreasing.java) |Pepcoding|Easy|Lv.1|Backtracking
|3    |[Print in Decreasing  Increasing  manner](https://github.com/vyash5075/Core-Java-Programming-Practices/edit/master/recursion/printDecreasingIncreasing.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/edit/master/recursion/printDecreasingIncreasing.java) |Pepcoding|Easy|Lv.1|Backtracking
|4    |[Factorial of a  number](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/factorial.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/factorial.java) |Pepcoding|Easy|Lv.1|Backtracking
|5    |[Power Linear](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/linearpower.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/linearpower.java) |Pepcoding|Easy|Lv.1|Backtracking
|6   |[ZigZag Print](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/ziggzgprint.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/ziggzgprint.java) |Pepcoding|Medium|Lv.2|Backtracking
|7   |[Tower Of Hanoi](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/tower_of_hanoi.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/tower_of_hanoi.java) |Pepcoding|Medium|Lv.2|Backtracking
|8  |[Display Array](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/display%20array.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/display%20array.java) |Pepcoding|Easy|Lv.1|Backtracking
|9  |[Maximum in Array](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/max_in_array.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/max_in_array.java) |Pepcoding|Easy|Lv.1|Backtracking
|10 |[First occurence](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/firstoccurenceofelement.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/firstoccurenceofelement.java) |Pepcoding|Easy|Lv.1|Backtracking
|11 |[Last occurence](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/lastoccurence.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/lastoccurence.java) |Pepcoding|Easy|Lv.1|Backtracking
|12 |[All Occurences](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/allindices.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/allindices.java) |Pepcoding|Easy|Lv.1|Recursion,Array
|13 |[Get all Subsequence of String](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/get%20subsequence.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/get%20subsequence.java) |Pepcoding|Medium|Lv.2|Recursion,String
|14 |[Nokia Keypad Combination](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/phonekeyscombination.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/phonekeyscombination.java) |Pepcoding|Medium|Lv.2|Recursion
|15. |[Get StairPath](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/getStairpaths.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/getStairpaths.java) |Pepcoding|Hard|Lv.3|Recursion
|16 |[Get mazepath](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/getmazepaths.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/getmazepaths.java) |Pepcoding|Hard|Lv.3|Recursion
|17 |[Get mazepathwithjumps](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/getmazepathswithjumps.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/getmazepathswithjumps.java) |Pepcoding|Hard|Lv.3|Recursion
|18 |[Print Subsequence of String](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/printsubsequence.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/printsubsequence.java) |Pepcoding|Medium|Lv.2|Recursion,String
|19 |[Print Nokia Keypad Combination](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/printkpc.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/printkpc.java) |Pepcoding|Medium|Lv.2|Recursion,String
|20 |[Print Stairs Path](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/printStairPaths.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/printStairPaths.java) |Pepcoding|Medium|Lv.2|Recursion
|21 |[Print Maze Path](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/printmazePaths.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/printmazePaths.java) |Pepcoding|Medium|Lv.2|Recursion
|22 |[Print Maze Path with Jumps](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/printmazePathswithjumps.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/printmazePathswithjumps.java) |Pepcoding|Medium|Lv.2|Recursion,Array
|23 |[Print Permutations](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/printpermutations.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/printpermutations.java) |Pepcoding|Medium|Lv.2|Recursion,String
|24 |[Print Encodings](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/printencodings.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/printencodings.java) |Pepcoding|Hard|Lv.3|Recursion,String
|25 |[Flood Fill](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/floodfill.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/floodfill.java) |Pepcoding|Hard|Lv.3|Recursion,Array,Graph, BFS
|26 |[Target Sum Subsets](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/targetsumsubsets.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/targetsumsubsets.java) |Pepcoding|Medium|Lv.2|Recursion,Array 
|27 |[Print N Queens](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/printNQueens.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/printNQueens.java) |Pepcoding|Hard|Lv.3|Recursion,Array 
|28 |[KNights Tour](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/printKnightsTour.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/printKnightsTour.java) |Pepcoding|Hard|Lv.3|Recursion,Array 
|29 |[Print Combinations](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/print%20combinations.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/print%20combinations.java) |Pepcoding|Medium|Lv.2|Recursion 
|30 |[Coin Change](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/coinchangeproblem.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/coinchangeproblem.java) |Pepcoding|Medium|Lv.2|Recursion,Array
|31 |[Coin Change2](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/coinchange2.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/coinchange2.java) |Pepcoding|Medium|Lv.2|Recursion,Array
|32 |[Coin. Change permutation](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/coinchange%20permutations.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/coinchange%20permutations.java) |Pepcoding|Medium|Lv.2|Recursion,Array
|33 |[Lexicographical order printing](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/lexicographicalorder.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/lexicographicalorder.java) |Pepcoding|Medium|Lv.2|Recursion,Math
|34 |[Sudoku Solver](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/sudokusolver.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/sudokusolver.java) |Pepcoding|Medium|Lv.2|Recursion,2D Array
|35 |[Number Sprint](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/number%20sprint.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/recursion/number%20sprint.java) |Pepcoding|Easy|Lv.1|Recursion


## Dynamic Programming
|  #  |      Problem     |   Solutions   | Source  | Difficulty  |Level |  Tags         
|-----|----------------|---------------|--------|-------------|-|------------
|1    |[nth Fibonacci](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/dp/nth%20fibonacci.java)|[Solution](https://github.com/vyash5075/Core-Java-Programming-Practices/blob/master/dp/nth%20fibonacci.java) |Practice|Easy|Lv.1|Math


## Miscellaneous
|  #  |      Problem     |   Solutions   | Source  | Difficulty  |Level |  Tags         
|-----|----------------|----------------|--------|-------------|-|------------
|1    |[Numbair Number Generator](https://github.com/vyash5075/Data-Structure-Algorithms/blob/master/miscellaneous/Numbair%20generator.java)|[Solution](https://github.com/vyash5075/Data-Structure-Algorithms/blob/master/miscellaneous/Numbair%20generator.java) |Wipro|Medium|Lv.2|Math. 

About

Includes Core-java coding Algorithms related to each and every topic.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Contributors 3

  •  
  •  
  •  

Languages

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy