Skip to content

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

๐Ÿš€ CP Core Algorithms 150 (Java Edition) !

A comprehensive Java library of 150 core algorithms for Competitive Programming, LeetCode, and SDE 1/2/3 interview preparation.



๐Ÿ”ฅ About This Repository

This repository contains a carefully structured collection of 150 essential algorithms implemented in Java.

It is designed for:

  • ๐Ÿ† Competitive Programming (Codeforces, AtCoder, CodeChef, etc.)
  • ๐Ÿ’ป LeetCode & coding platforms
  • ๐ŸŽฏ SDE 1 / SDE 2 / SDE 3 technical interviews
  • ๐Ÿ“ˆ Long-term Data Structures & Algorithms mastery

Each implementation focuses on:

  • Clean structure
  • Optimal Time & Space Complexity
  • Reusability for contests
  • Interview-ready coding standards

๐Ÿ“‚ Project Structure

CP-Core-Algorithms-150/
โ””โ”€โ”€ src/main/java/org/algos/
    โ”œโ”€โ”€ Arrays
    โ”œโ”€โ”€ SearchingAndSorting
    โ”œโ”€โ”€ Strings
    โ”œโ”€โ”€ Stacks
    โ”œโ”€โ”€ QueueAndDeque
    โ”œโ”€โ”€ LinkedList
    โ”œโ”€โ”€ Trees
    โ”œโ”€โ”€ Graphs
    โ”œโ”€โ”€ DynamicProgramming
    โ”œโ”€โ”€ Greedy
    โ”œโ”€โ”€ RecursionORBacktracking
    โ”œโ”€โ”€ MathORNumberTheory
    โ”œโ”€โ”€ BitManipulation
    โ””โ”€โ”€ AdvancedAndRare

๐Ÿง  Categories Covered

๐Ÿ”ข Arrays

Prefix Sum, Two Pointers, Sliding Window, Kadaneโ€™s Algorithm, Subarray problems.

๐Ÿ” Searching & Sorting

Binary Search Variations, Merge Sort, Quick Sort, Custom Comparator usage.

๐ŸŒ Graphs

BFS, DFS, Dijkstra, Bellman-Ford, Floyd-Warshall, Topological Sort, DSU, MST.

๐Ÿง  Dynamic Programming

0/1 Knapsack, LIS, LCS, Matrix DP, Digit DP, Bitmask DP.

๐ŸŒณ Trees

Binary Tree Traversals, BST operations, LCA, Segment Tree, Fenwick Tree.

๐Ÿงฎ Math & Number Theory

Sieve of Eratosthenes, GCD, Modular Arithmetic, Fast Power, Combinatorics.

โš™๏ธ Bit Manipulation

Bitmasking techniques, Subset generation, XOR patterns.

๐Ÿ” Recursion & Backtracking

Permutations, Combinations, N-Queens, Subsets, Constraint search problems.

๐Ÿ’ก Greedy

Activity Selection, Interval Scheduling, Greedy proof-based solutions.

๐Ÿ“š Stack / Queue / LinkedList

Monotonic Stack, Deque optimization, Classic Linked List operations.

๐Ÿงช Advanced & Rare

Advanced data structures and specialized competitive programming techniques.


๐ŸŽฏ Why This Repository?

โœ” 150 battle-tested algorithms
โœ” Structured category-wise organization
โœ” CP + LeetCode + Interview focused
โœ” Clean and reusable Java implementations
โœ” Built for serious problem solvers

This repository serves as:

  • ๐Ÿ“˜ A Competitive Programming revision handbook
  • ๐Ÿ’ผ An interview preparation toolkit
  • ๐Ÿš€ A long-term algorithm mastery project

๐Ÿ›  Tech Stack

  • Language: Java
  • Focus: Performance + Clarity
  • Structure: Competitive Programming oriented
  • Designed for scalability (can expand beyond 150)

๐Ÿ“บ Learning & Content

For structured explanations and algorithm deep-dives:

๐Ÿ‘‰ https://youtube.com/@code-with-Bharadwaj


โญ Support

If this repository helps you:

  • Star โญ the repo
  • Fork it
  • Share it
  • Use it in your CP journey

๐Ÿš€ Keep Grinding. Keep Building. Keep Winning.

About

A comprehensive Java library of 150 core algorithms for Competitive Programming, LeetCode, and SDE 1/2/3 interview preparation.

Topics

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages