![pepcoding-dsa](https://camo.githubusercontent.com/f897b429c7597cc4a01ba83cd3e691dbee03dc13683cdc8b8881171fe41c9ccd/68747470733a2f2f736f6369616c6966792e6769742e63692f7468617462656175746966756c647265616d2f706570636f64696e672d6473612f696d6167653f6465736372697074696f6e3d31266465736372697074696f6e4564697461626c653d546869732532307265706f7369746f7279253230636f6e73697374732532306f66253230616c6c2532307468652532306d6174657269616c25323066726f6d2532306d792532306461746125323073747275637475726573253230616e64253230616c676f726974686d732532307072657061726174696f6e2e266c616e67756167653d31266e616d653d31266f776e65723d31267061747465726e3d536f6c6964267468656d653d4461726b)
Category |
Number Solved |
Getting Started |
14/14 β
|
Patterns |
13/20 ππ» |
Function and Arrays |
20/20 β
|
2D Arrays |
9/9 β
|
String, String Builder and ArrayList |
6/6 β
|
Total |
62/69 |
Category |
Number Solved |
Introduction to Recursion |
8/8 β
|
Recursion in Arrays |
6/6 β
|
Recursion with ArrayLists |
5/5 β
|
Recursion on its way up |
6/7 β
|
Recursion Backtracking |
4/4 β
|
Total |
29/30 |
Category |
Number Solved |
Stacks and Queues |
0/0 |
Linked Lists |
2/2 β
|
Generic Tree |
0/0 |
Binary Tree |
0/0 |
Binary Search Tree |
0/0 |
Total |
2/2 |
Category |
Number Solved |
Dynamic Programming and Greedy |
0/0 |
Time and Space Complexity |
0/0 |
Total |
0/0 |
Category |
Number Solved |
Test-01 |
3/3 |
Test-02 |
5/5 |
Total |
8/8 |
Go to the Repository & drop a π if this helped you!
![wakatime](https://camo.githubusercontent.com/b130e656f8179faf20e7bb24b9e1388907e76cb4e67e13cfb6770bed59361241/68747470733a2f2f77616b6174696d652e636f6d2f62616467652f757365722f39373964633333612d313866322d343361382d393332352d3336323063613633383535652f70726f6a6563742f33613930663262312d643635362d343334382d613832312d3465633763643237333331662e737667)
These are the accepted solutions to the Pepcoding Problem Set, written in Java
by Milind Mishra.
Level 1
Level 2
Level 3
L1 Solutions