Data-Structures-Algorithms

KO | EN

gitlite — search

#python #react #typescript #llm #go #rust #deep-learning #linux #macos #java #nodejs #awesome #security #mcp

Data-Structures-Algorithms

(★ 32)

:pushpin: :books: Solution of competitive programming problems and challenges, Project Euler Solutions, Data Structures, Data Structure implementations, Algorithms and Interview Questions.

Data-Structures-Algorithms 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Competitive Programming
:pushpin: :books: Solution of competitive programming problems and challenges, Project Euler Solutions, Data Structures, Data Structure implementations, Algorithms and Interview Questions.

## How to Contribute:

- Fork this repo
- Open an [Github Issue](https://github.com/tanaytoshniwal/Data-Structures-Algorithms/issues) regarding the changes you're going to make
- Make the changes in the Forked repo
- **MAKE SURE TO ADD YOUR CHANGES IN README.md FILE!!!**
- Raise a PR against this Repo!

That's all you need to know about the process now it's your turn to help us improve the repository, thank you again!

## Contribution Guidelines

Please read our [Contribution Guidelines](https://github.com/tanaytoshniwal/Data-Structures-Algorithms/blob/master/CONTRIBUTING.md) before you contribute to this project.

------------------------------------------------------------------------------

## Index
+ [Data Structures and Algorithms](#Data-Structures-and-Algorithms)
    + [Ad-hoc Problems](#Ad-hoc-Problems)
    + [Algorithms](#Algorithms)
    + [Competitions-Challenges](#Competitions-Challenges)
    + [Compiler Design](#Compiler-Design)
    + [Data Structures](#Data-Structures)
    + [Fast IO](#Fast-IO)
    + [Interview Preparation](#Interview-Preparation)
    + [Patterns](#Patterns)
    + [Project Euler](#Project-Euler)
------------------------------------------------------------------------------
## Content

### Ad-hoc-Problems:

Contains some popular **Ad-hoc Problems**.

| Topic/Question | C | C++ | Java | Python |
|---------|:---------:|:---------:|:---------:|:---------:|
| Circular List of Students | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
| Equalize| <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
| Interesting Sequences| <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
| Light up the Bulbs| <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
| Rectangular Area| <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
| Winning Strategy| <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
------------------------------------------------------------------------------

### Algorithms:

Contains some popular **Algorithms** and related problems.

#### Topics
+ **Algorithms-Problems**
    + **Binary Search**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Agressive Cows | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Bishu and Soilders | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | BooBoo and Upsolving | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Compare Strings | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **Greedy**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Activity Selection | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Lopov | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Minimum Absolute Difference | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Nikunj and Donuts | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Perimeter with Conditions | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Problem Discussion | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Save Energy | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Weighted Job Scheduling | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Winning Lottery | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **Linear Search**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Breakup App | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Holiday Season | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Manna's First Name | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Min-Max | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Monk Takes a Walk | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Policemen and thieves | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Repeated K Times | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Rest in peace-21-1 | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Simple Search | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Square Transaction | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | The Normal Type | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **Merge Sort**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Inversion Count | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Murder | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **BackTracking**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Crossword | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Graph Coloring | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | N-Queens | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Permutations of a String | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Rat in a Maze | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Sudoku | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **Bit Manipulation**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Check ith bit | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Check Odd or Even | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 | Check Power of 2 | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Clear all bits from MSB | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Convert Number to Binary | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Flip ith bit | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Return First Set Bit | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Turn Off First Set Bit | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Turn Off ith Bit | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Turn On ith Bit | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |

------------------------------------------------------------------------------
+ **Dynamic Programming**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | 01 Knapsack Problem | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 | Alpha Code | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Boredom | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Catalan Number | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 | Coin Change | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 | Construct the Array | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Count BSTs | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Edit Distance | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 | Egg Dropping Puzzle | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 | Fibonacci Numbers | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 | K-Divisibility of Array | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Kadane's Algorithm | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Longest Bitonic Subarray | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Longest Common Subsequence | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 | Longest Consecutive Subsequence | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Longest Increasing Subsequence | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 | Loot Houses | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Magic Grid | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Maximum Non-Negative Subarray | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Maximum Non-Negative Subarray Sum | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Maximum Product Subarray | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Maximum Square with all Zeros | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Maximum Sum Contiguous Subarray | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Maximum Sum Rectangle | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Min Cost Path | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 | Mindbending Product | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Minimum Number of Chocolates | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Right Down the Grid | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Sam and Substrings | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Staircase Problem | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Ugly Numbers | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 ------------------------------------------------------------------------------

+ **Greedy**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Fractional Knapsack | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Kruskal's Algorithm | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 | Prims Algorithm | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 ------------------------------------------------------------------------------

+ **Searching**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Binary Search | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Linear Search | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **Sorting**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Bubble Sort | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Counting Sort | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Heap Sort | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Insertion Sort | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> |
 | Merge Sort | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Quick Sort | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Selection Sort | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **Strings**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Funny String | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 | Gemstones | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Print Keypad | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Print Subsequences | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Return Subsequences | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------
------------------------------------------------------------------------------

### Competitions-Challenges:

Contains some Questions from Online **Competitions and Challenges**.

+ **CodeChef**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | BST Operations | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Chef Restaurant | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | CNOTE | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | CodeChef-OCT17 : A Balanced Contest | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Compiler | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Discrepancies in the Voters List | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Hussain Set | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | K-Concatenation | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Permutation and Palindrome | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Sudoku | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Variation | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Video Game | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 ------------------------------------------------------------------------------

+ **Codezen**

**Programming Fundamentals**

**Conditionals and loops**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Alpha Pattern | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Find power of a number | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Number Pattern | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Number Pattern 1 | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Number Pattern 2 | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Number Pattern 3 | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Sum of even and odd | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Total Salary | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

**Patterns**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Alpha Pattern | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Binary Pattern | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Galaxy of Stars | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Give me Triangle | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Interesting Alphabets | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Number Pattern | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Pattern_ify | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Repeat Triangle | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Repeating Numbers | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Reversing Series Pattern | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **Google Code Jam**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | You Can Go Your Own Way | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 | Foregone Solution | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 ------------------------------------------------------------------------------

+ **HackerEarth**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Fate of the Mormont | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | MaxMul | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Network Overflow | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **HackerEarth-CodeArena**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Competition 1 | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **HackerEarth-CodeEnigma**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Anushka | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Chug | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Number Pattern | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Star | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | String Manipulation | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Stuck In A Maze | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | SubSequence | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Sum It Up | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | TTT | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **HackerEarth-DecemberCircuits17**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Left Or Right | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **HackerEarth-ThinkAThonV2**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Paper Planes | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **HackerRank**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Grading Students | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Operations In Heap | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Jesse And Cookies | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------
------------------------------------------------------------------------------

### Compiler Design

Contains some **Compiler Design** Course Programs.

| Topic/Question | C | C++ | Java | Python |
|---------|:---------:|:---------:|:---------:|:---------:|
| Elimination of Left Factoring | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
| Elimination of Left Recursion| <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
| Find First and Follow| <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
| Find Lead and Trail| <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
| Infix to Postfix| <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
| Lexical Analyzer| <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
------------------------------------------------------------------------------

### Data-Structures

Contains implementation of some popular **Data Structures** and related problems.

+ **Binary Search Tree**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Binary Search Tree Implementation | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **Binary Tree**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Binary Tree Implementation | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> |
 ------------------------------------------------------------------------------

+ **Circular Linked List**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Circular Linked List Implementation | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **Data Structures Problems**

+ **Arrays**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Add Alternate Elements of 2D Array | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Akash and the Assignment | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Converting a Sequence to Another | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 | Find the String | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Fredo and Large Numbers | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> |
 | Honey Bees | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Left or Right | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Little Jhool and World Tour | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> |
 | Micro and Array Update | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> |
 | Micro and Sweet Distribution | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Professor and his Operations | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> |
 | Remove Duplicates | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Roy and Symmetric Logos | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Saul Goodman's Problem Statement | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Sorting the Skills | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Submatrix Updates | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Symmetric Matrix | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | The Wealthy Landlord | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Unique Subarrays | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **Graphs**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Monk at the Graph Factory | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 ------------------------------------------------------------------------------

+ **Linked List**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Add Two Numbers Represented by a Linked List | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Add K Nodes | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Check Palindrome | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Delete From End | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Delete From Start | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Delete Node with Key | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Delete Node without Head | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Detect Loop | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Find Mid Element | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Flatten a Linked List | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Get Nth Node From Last | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Implement Queue Using Linked List | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Intersection Point in Y Shaped Linked List | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Make Maximum Number | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Merge Reverse | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Merge Two Sorted Linked List | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Merge Sort | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 | Merge Two List | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 | Pairwise Swap Elements | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Remove Loop | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Reverse a Linked List | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Reverse in group of given size | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Rotate Counter Clockwise | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Stack Implementation | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **Matrices**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Print Elements in Spiral | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Print Elements in ZigZag | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **Stack**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Facitoo and Bridge | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **Strings**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Different Names | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 | Find the String | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Love of Characters | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Non Repeating Character | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | String Occurence | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **Trees**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Bottom View of Binary Tree | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | BST to Tree with sum of all Keys | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Check if 2 trees are identical | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Check if tree is BST | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Check if tree is symmetric | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Correct a Binary Tree | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Diameter of a Binary Tree | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Distinct Count | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Find Max Subtree Sum | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Kth Latgest Element | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Kth Smallest Element | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Lowest Common Ancestor in BST | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Maximum path Sum | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Merge 2 BST with Limited Extra Space | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Monk and his Friends | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 | Monk watching Fight | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Number of Balanced BST | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Print Left View of Binary Tree | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Print Level Order in Spiral Form | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Print Path with given Sum | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Print Tree in Vertical Order | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Yatin plays PUBG | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **Tree Traversal**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | InOrder Traversal | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Level Order Traversal | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Post Order Traversal | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Pre Order Traversal | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Facitoo and College | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Facitoo and Bridge | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Facitoo and Melon | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **Doubly Linked List**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Doubly Linked List Implementation | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **Heaps**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Max Heap Implementation | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Min Heap Implementation | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **Linked List**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Linked List Implementation | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> |
 ------------------------------------------------------------------------------

+ **Queues**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Queue Implementation | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **Stacks**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Stack Implementation | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> |
 ------------------------------------------------------------------------------
------------------------------------------------------------------------------

### Fast IO

Contains some **Competitive Programming** tips for faster Input/Output.

| Topic/Question | C | C++ | Java | Python |
|---------|:---------:|:---------:|:---------:|:---------:|
| C++ | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
| Java| <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
------------------------------------------------------------------------------

### Interview Preparation

Contains some **Interview Preparation** related programs.

+ **HackerRank-Interview Preparation Kit**
    + **Arrays**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | 2D Arrays-DS | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Left Rotation| <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 | Minimum Swaps 2| <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **String Manipulation**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Alternating Characters | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Making Anagrams| <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Sherlock and the Valid String| <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

+ **Warm-up Challenges**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Counting Valleys | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 | Jumping on the Clouds| <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Repeated String| <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 | Sock Merchant| <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 ------------------------------------------------------------------------------

+ **Practice-Questions**

| Topic/Question | C | C++ | Java | Python |
 |---------|:---------:|:---------:|:---------:|:---------:|
 | Count Distinct Array Elements | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Euler Circuit in a graph| <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Jason Fights Monsters| <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Lucky Four | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 | Migratory Birds| <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Order of a String| <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Pattern Freq | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
 | Permutations Of a String| <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
 | Triangle of Stars| <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
 ------------------------------------------------------------------------------

------------------------------------------------------------------------------

### Patterns

Contains some popular **Patterns** related programs.

| Topic/Question | C | C++ | Java | Python |
|---------|:---------:|:---------:|:---------:|:---------:|
| Pattern 1 | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
| Pattern 2| <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
| Pattern 3| <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> |
------------------------------------------------------------------------------

### Project Euler

Contains some **Project Euler** programs.

| Topic/Question | C | C++ | Java | Python |
|---------|:---------:|:---------:|:---------:|:---------:|
| Problem 1 | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> |
| Problem 2| <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [x] </li></ul> |
| Problem 3| <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
| Problem 4 | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
| Problem 5| <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
| Problem 6| <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
| Problem 7 | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
| Problem 8| <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
| Problem 9| <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
| Problem 10 | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
| Problem 11| <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
| Problem 12| <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
| Problem 13 | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
| Problem 14| <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
| Problem 15| <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> |
| Problem 16| <ul><li> [ ] </li></ul> | <ul><li> [ ] </li></ul> | <ul><li> [x] </li></ul> | <ul><li> [ ] </li></ul> |
------------------------------------------------------------------------------

Data-Structures-Algorithms

Data-Structures-Algorithms 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Data-Structures-Algorithms

Data-Structures-Algorithms 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README