Algorithm | File |
---|---|
Heap Sort | heap_sort.cpp |
Quick Sort | quick_sort.cpp |
Merge Sort | merge_sort |
Parenthesis Checker | parenthsis_checker.cpp |
String Permutation | string_permutation.cpp |
Trie Data Structure | trie_implementation.cpp |
N Queen(Backtracking) | n_queen.cpp |
N Queen(Branch&Bound) | n_queen_b&b.cpp |
M - Coloring | m_coloring.cpp |
Subset | subset.cpp |
Sudoku Solver | sudoku_solver.py |
Rat in a Maze | rat_in_maze.cpp |
Dice Rolls | diceRolls.cpp |
Dice Sum | diceSum.cpp |
Dice Sum Efficient | diceSumEfficient.cpp |
Magic Index | magic_index.cpp |
Manacher's Algorithm | manachar's_algo.cpp |
Segment Tree | segment_tree |
Magic Square | magic_square.cpp |
Serialize-Deserialize | serialize-deserialize.cpp |
Longest Valid Parenthesis | longest_valid_parenthesis.cpp |
Peak Finder - 1D | peak_finder_1.cpp |
Peak Finder - 2D | peak_finder_2.cpp |
All Other Product | all_other_prod.cpp |
Dyck Words | dyck_words.cpp |
Z - Algorithm | z_algorithm.cpp |
Roman To Int | roman_int.py |
Regular Expression | regex.txt |
Tower of Hanoi | tower_of_hanoi |
Union-Find Data Structure | union_find |
Queue Implementation | queue.cpp |
Circular Queue | circular_queue.cpp |
Heap - MaxHeap | max_heap.cpp |
Heap - MinHeap | min_heap.cpp |
Window Sliding | max_sum_window_sliding.cpp |
K-closest Elements | k_closest.cpp |
Naive Suffix Array | naive_suffix.cpp |
Linked List | linked_list.cpp |
KMP - Algorithm | kmp.cpp |
Binary Search Tree | bst.cpp |
Banker's Algorithm | bankers.c |
Producer-Consumer Problem | prod_cons.py |
Ceaser Cypher | ceaser.py |
Kruskal's Algorithm | kruskal.cpp |
Prim's Algorithm | |
Kadane's Algorithm | kadane's algorithm.cpp |
Snake & Ladder Problem | snake_ladder.cpp |
Beadth First Search | bfs.cpp |
Deapth First Search | dfs.cpp |
Detect Cycle | printCycle.cpp |
Hamiltonian Cycle | hamiltonian_cycle.cpp |
Integer Knapsack(0/1) With Multiples | integer_knapsack.cpp |
Integer Knapsack(0/1) Without Multiples | integer_knap.cpp |
Fractional Knapsack | fractional_knapsack.cpp |
Longest Common Subsequence | lcs.cpp |
Longest Increasing Subsequence | longest_incr_subseq.cpp |
Longest Common Prefix | lcp.cpp |
Prime Sum | prime_sum.cpp |
Median of Two Arrays | median_arrays.cpp |
Longest Palindrome Substring | longestpalinsubstring.cpp |
Rearrange Array | rearrange_array.cpp |
Smallest Subarray | smallest_subarray.cpp |
Longest Subarray | longest_subarray.cpp |
Bit-wise Operators | bitwise_operator |
Two Sum Problem | two_sum.cpp |
Coin Change | coin_change.cpp |
Second Largest BST | sec_largest_bst.cpp |
Minimum Path Sum(2D) | min_pathsum.cpp |
Minimum Path Sum(Triangle) | min_pathsum_again.cpp |
Unique paths | unique_paths.cpp |
House Robber Problem 1 | house_robber.py |
House Robber Problem 2 | house_robber_again.py |
Partition The Numbers | partition.cpp |
Possible Palindromes | possible_palindrome.cpp |
Binary Search | binary_search |
Merge Pdf | merge_pdfs |
Trailing Zeroes in a factorial | trailing_zeros.cpp |
Codejam Problems | codejam |
InterviewBit good problems | interviewbit |
Facebook HackerCup Problems | facebook_ |
Advent of Code | advent_of_code |
forked from ithink20/Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 2
akshayjain3450/Algorithms-1
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Implemented Algorithms & Problems
Resources
Stars
Watchers
Forks
Releases
No releases published
Languages
- C++ 84.6%
- HTML 5.1%
- Python 4.9%
- C 2.8%
- JavaScript 2.6%