{"id":18806355,"url":"https://github.com/ideepika/code_practice","last_synced_at":"2026-03-19T06:30:17.653Z","repository":{"id":156454950,"uuid":"188085731","full_name":"ideepika/code_practice","owner":"ideepika","description":"This repository contains random as well as organised track of practice problems, for consistent and non-overwhelming breakdown that can worked out daily","archived":false,"fork":false,"pushed_at":"2019-05-22T18:55:15.000Z","size":11,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-05-22T01:08:31.271Z","etag":null,"topics":["algorithms","challenges-solved","interview-practice"],"latest_commit_sha":null,"homepage":"","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ideepika.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2019-05-22T17:37:51.000Z","updated_at":"2023-03-04T08:41:45.000Z","dependencies_parsed_at":null,"dependency_job_id":"9cdca6c9-ed22-4235-be1a-74a58c4d4f39","html_url":"https://github.com/ideepika/code_practice","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ideepika/code_practice","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ideepika%2Fcode_practice","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ideepika%2Fcode_practice/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ideepika%2Fcode_practice/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ideepika%2Fcode_practice/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ideepika","download_url":"https://codeload.github.com/ideepika/code_practice/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ideepika%2Fcode_practice/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28816528,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-27T12:25:15.069Z","status":"ssl_error","status_checked_at":"2026-01-27T12:25:05.297Z","response_time":168,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","challenges-solved","interview-practice"],"created_at":"2024-11-07T22:48:16.690Z","updated_at":"2026-01-27T16:06:52.711Z","avatar_url":"https://github.com/ideepika.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# CHALLENGES\n\n### First Milestone: E-Maxx Algorithms in English \nCredits: (https://cp-algorithms.com/)\n\n\n### Algebra\n\n- [ ]    Fundamental\n    \n\n- [ ]    [Binary Exponentiation](https://cp-algorithms.com/algebra/binary-exp.html)\n    \n- [ ]    [Euclidean algorithm for computing the greatest common divisor](https://cp-algorithms.com/algebra/euclid-algorithm.html)\n    \n- [ ]    [Extended Euclidean Algorithm](https://cp-algorithms.com/algebra/extended-euclid-algorithm.html)\n    \n- [ ]    [Linear Diophantine Equations](https://cp-algorithms.com/algebra/linear-diophantine-equation.html)\n    \n- [ ]    [Fibonacci Numbers](https://cp-algorithms.com/algebra/fibonacci-numbers.html)\n    \n\n- [ ]  Prime numbers\n    \n\n- [ ]  [Sieve of Eratosthenes](https://cp-algorithms.com/algebra/sieve-of-eratosthenes.html)\n    \n- [ ]  [Sieve of Eratosthenes With Linear Time Complexity](https://cp-algorithms.com/algebra/prime-sieve-linear.html)\n    \n- [ ]  [Primality tests](https://cp-algorithms.com/algebra/primality_tests.html)\n    \n- [ ]  [Integer factorization](https://cp-algorithms.com/algebra/factorization.html)\n    \n\n- [ ]  Number-theoretic functions\n    \n\n- [ ]  [Euler's totient function](https://cp-algorithms.com/algebra/phi-function.html)\n    \n- [ ]  [Number of divisors / sum of divisors](https://cp-algorithms.com/algebra/divisors.html)\n    \n\n- [ ]  Modular arithmetic\n    \n\n- [ ]  [Modular Inverse](https://cp-algorithms.com/algebra/module-inverse.html)\n    \n- [ ]  [Linear Congruence Equation](https://cp-algorithms.com/algebra/linear_congruence_equation.html)\n    \n- [ ]  [Chinese Remainder Theorem](https://cp-algorithms.com/algebra/chinese-remainder-theorem.html)\n    \n- [ ]  [Factorial modulo](https://cp-algorithms.com/algebra/factorial-modulo.html)\n    \n- [ ]  [p](https://cp-algorithms.com/algebra/factorial-modulo.html)\n    \n- [ ]  [p](https://cp-algorithms.com/algebra/factorial-modulo.html)\n    \n- [ ]  [Discrete Root](https://cp-algorithms.com/algebra/discrete-root.html)\n    \n- [ ]  [Primitive Root](https://cp-algorithms.com/algebra/primitive-root.html)\n    \n- [ ]  [Discrete Log](https://cp-algorithms.com/algebra/discrete-log.html)\n    \n- [ ]  [Montgomery Multiplication](https://cp-algorithms.com/algebra/montgomery_multiplication.html)\n    \n\n- [ ]  Number systems\n    \n\n- [ ]  [Balanced Ternary](https://cp-algorithms.com/algebra/balanced-ternary.html)\n    \n- [ ]  [Gray code](https://cp-algorithms.com/algebra/gray-code.html)\n    \n\n- [ ]  Miscellaneous\n    \n\n- [ ]  [Enumerating submasks of a bitmask](https://cp-algorithms.com/algebra/all-submasks.html)\n    \n- [ ]  [Arbitrary-Precision Arithmetic](https://cp-algorithms.com/algebra/big-integer.html)\n    \n- [ ]  [Fast Fourier transform](https://cp-algorithms.com/algebra/fft.html)\n    \n- [ ]  [Operations on polynomials and series](https://cp-algorithms.com/algebra/polynomial.html)\n    \n\n### Data Structures\n\n- [ ]  Fundamentals\n    \n\n- [ ]  [Minimum Stack / Minimum Queue](https://cp-algorithms.com/data_structures/stack_queue_modification.html)\n    \n- [ ]  [Sparse Table](https://cp-algorithms.com/data_structures/sparse-table.html)\n    \n\n- [ ]  Trees\n    \n\n- [ ]  [Disjoint Set Union](https://cp-algorithms.com/data_structures/disjoint_set_union.html)\n    \n- [ ]  [Fenwick Tree](https://cp-algorithms.com/data_structures/fenwick.html)\n    \n- [ ]  [Sqrt Decomposition](https://cp-algorithms.com/data_structures/sqrt_decomposition.html)\n    \n- [ ]  [Segment Tree](https://cp-algorithms.com/data_structures/segment_tree.html)\n    \n- [ ]  [Treap](https://cp-algorithms.com/data_structures/treap.html)\n    \n- [ ]  [Sqrt Tree](https://cp-algorithms.com/data_structures/sqrt-tree.html)\n    \n- [ ]  [Randomized Heap](https://cp-algorithms.com/data_structures/randomized_heap.html)\n    \n\n- [ ]  Advanced\n    \n\n- [ ]  [Deleting from a data structure in O(T(n)log n)](https://cp-algorithms.com/data_structures/deleting_in_log_n.html)\n    \n\n### Dynamic Programming\n\n- [ ]  DP optimizations\n    \n\n- [ ]  [Divide and Conquer DP](https://cp-algorithms.com/dynamic_programming/divide-and-conquer-dp.html)\n    \n\n- [ ]  Tasks\n    \n\n- [ ]  [Dynamic Programming on Broken Profile. Problem \"Parquet\"](https://cp-algorithms.com/dynamic_programming/profile-dynamics.html)\n    \n- [ ]  [Finding the largest zero submatrix](https://cp-algorithms.com/dynamic_programming/zero_matrix.html)\n    \n\n### String Processing\n\n- [ ]  Fundamentals\n    \n\n- [ ]  [String Hashing](https://cp-algorithms.com/string/string-hashing.html)\n    \n- [ ]  [Rabin-Karp for String Matching](https://cp-algorithms.com/string/rabin-karp.html)\n    \n- [ ]  [Prefix function](https://cp-algorithms.com/string/prefix-function.html)\n    \n- [ ]  [Z-function](https://cp-algorithms.com/string/z-function.html)\n    \n- [ ]  [Suffix Array](https://cp-algorithms.com/string/suffix-array.html)\n    \n- [ ]  [Aho-Corasick algorithm](https://cp-algorithms.com/string/aho_corasick.html)\n    \n\n- [ ]  Advanced\n    \n\n- [ ]  [Suffix Tree](https://cp-algorithms.com/string/suffix-tree-ukkonen.html)\n    \n- [ ]  [Suffix Automaton](https://cp-algorithms.com/string/suffix-automaton.html)\n    \n- [ ]  [Lyndon factorization](https://cp-algorithms.com/string/lyndon_factorization.html)\n    \n\n- [ ]  Tasks\n    \n\n- [ ]  [Expression parsing](https://cp-algorithms.com/string/expression_parsing.html)\n    \n- [ ]  [Manacher's Algorithm - Finding all sub-palindromes in O(N)](https://cp-algorithms.com/string/manacher.html)\n    \n- [ ]  [Finding repetitions](https://cp-algorithms.com/string/main_lorentz.html)\n    \n\n### Linear Algebra\n\n- [ ]  Matrices\n    \n\n- [ ]  [Gauss \u0026 System of Linear Equations](https://cp-algorithms.com/linear_algebra/linear-system-gauss.html)\n    \n- [ ]  [Gauss \u0026 Determinant](https://cp-algorithms.com/linear_algebra/determinant-gauss.html)\n    \n- [ ]  [Kraut \u0026 Determinant](https://cp-algorithms.com/linear_algebra/determinant-kraut.html)\n    \n- [ ]  [Rank of a matrix](https://cp-algorithms.com/linear_algebra/rank-matrix.html)\n    \n\n### Combinatorics\n\n- [ ]  Fundamentals\n    \n\n- [ ]  [Finding Power of Factorial Divisor](https://cp-algorithms.com/algebra/factorial-divisors.html)\n    \n- [ ]  [Binomial Coefficients](https://cp-algorithms.com/combinatorics/binomial-coefficients.html)\n    \n- [ ]  [Catalan Numbers](https://cp-algorithms.com/combinatorics/catalan-numbers.html)\n    \n\n- [ ]  Techniques\n    \n\n- [ ]  [The Inclusion-Exclusion Principle](https://cp-algorithms.com/combinatorics/inclusion-exclusion.html)\n    \n- [ ]  [Burnside's lemma / Pólya enumeration theorem](https://cp-algorithms.com/combinatorics/burnside.html)\n    \n- [ ]  [Stars and bars](https://cp-algorithms.com/combinatorics/stars_and_bars.html)\n    \n- [ ]  [Generating all](https://cp-algorithms.com/combinatorics/generating_combinations.html)\n    \n- [ ]  [K](https://cp-algorithms.com/combinatorics/generating_combinations.html)\n    \n- [ ]  [K-combinations](https://cp-algorithms.com/combinatorics/generating_combinations.html)\n    \n\n- [ ]  Tasks\n    \n\n- [ ]  [Placing Bishops on a Chessboard](https://cp-algorithms.com/combinatorics/bishops-on-chessboard.html)\n    \n- [ ]  [Balanced bracket sequences](https://cp-algorithms.com/combinatorics/bracket_sequences.html)\n    \n- [ ]  [Counting labeled graphs](https://cp-algorithms.com/combinatorics/counting_labeled_graphs.html)\n    \n\n### Numerical Methods\n\n- [ ]  Search\n    \n\n- [ ]  [Ternary Search](https://cp-algorithms.com/num_methods/ternary_search.html)\n    \n- [ ]  [Newton's method for finding roots](https://cp-algorithms.com/num_methods/roots_newton.html)\n    \n\n- [ ]  Integration\n    \n\n- [ ]  [Integration by Simpson's formula](https://cp-algorithms.com/num_methods/simpson-integration.html)\n    \n\n### Geometry\n\n- [ ]  Elementary operations\n    \n\n- [ ]  [Basic Geometry](https://cp-algorithms.com/geometry/basic-geometry.html)\n    \n- [ ]  [Finding the equation of a line for a segment](https://cp-algorithms.com/geometry/segment-to-line.html)\n    \n- [ ]  [Intersection Point of Lines](https://cp-algorithms.com/geometry/lines-intersection.html)\n    \n- [ ]  [Check if two segments intersect](https://cp-algorithms.com/geometry/check-segments-intersection.html)\n    \n- [ ]  [Intersection of Segments](https://cp-algorithms.com/geometry/segments-intersection.html)\n    \n- [ ]  [Circle-Line Intersection](https://cp-algorithms.com/geometry/circle-line-intersection.html)\n    \n- [ ]  [Circle-Circle Intersection](https://cp-algorithms.com/geometry/circle-circle-intersection.html)\n    \n- [ ]  [Common tangents to two circles](https://cp-algorithms.com/geometry/tangents-to-two-circles.html)\n    \n- [ ]  [Length of the union of segments](https://cp-algorithms.com/geometry/length-of-segments-union.html)\n    \n\n- [ ]  Polygons\n    \n\n- [ ]  [Oriented area of a triangle](https://cp-algorithms.com/geometry/oriented-triangle-area.html)\n    \n- [ ]  [Area of simple polygon](https://cp-algorithms.com/geometry/area-of-simple-polygon.html)\n    \n- [ ]  [Check if points belong to the convex polygon in O(log N)](https://cp-algorithms.com/geometry/point-in-convex-polygon.html)\n    \n- [ ]  [Pick's Theorem - area of lattice polygons](https://cp-algorithms.com/geometry/picks-theorem.html)\n    \n- [ ]  [Lattice points of non-lattice polygon](https://cp-algorithms.com/geometry/lattice-points.html)\n    \n\n- [ ]  Convex hull\n    \n\n- [ ]  [Convex hull construction using Graham's Scan](https://cp-algorithms.com/geometry/grahams-scan-convex-hull.html)\n    \n- [ ]  [Convex hull trick and Li Chao tree](https://cp-algorithms.com/geometry/convex_hull_trick.html)\n    \n\n- [ ]  Sweep-line\n    \n\n- [ ]  [Search for a pair of intersecting segments](https://cp-algorithms.com/geometry/intersecting_segments.html)\n    \n- [ ]  [Point location in O(log N)](https://cp-algorithms.com/geometry/point-location.html)\n    \n\n- [ ]  Miscellaneous\n    \n\n- [ ]  [Finding the nearest pair of points](https://cp-algorithms.com/geometry/nearest_points.html)\n    \n- [ ]  [Delaunay triangulation and Voronoi diagram](https://cp-algorithms.com/geometry/delaunay.html)\n    \n\n### Graphs\n\n- [ ]  Graph traversal\n    \n\n- [ ]  [Breadth First Search](https://cp-algorithms.com/graph/breadth-first-search.html)\n    \n- [ ]  [Depth First Search](https://cp-algorithms.com/graph/depth-first-search.html)\n    \n\n- [ ]  Connected components, bridges, articulations points\n    \n\n- [ ]  [Finding Connected Components](https://cp-algorithms.com/graph/search-for-connected-components.html)\n    \n- [ ]  [Finding Bridges in O(N+M)](https://cp-algorithms.com/graph/bridge-searching.html)\n    \n- [ ]  [Finding Bridges Online](https://cp-algorithms.com/graph/bridge-searching-online.html)\n    \n- [ ]  [Finding Articulation Points in O(N+M)](https://cp-algorithms.com/graph/cutpoints.html)\n    \n- [ ]  [Strongly Connected Components and Condensation Graph](https://cp-algorithms.com/graph/strongly-connected-components.html)\n    \n\n- [ ]  Single-source shortest paths\n    \n\n- [ ]  [Dijkstra - finding shortest paths from given vertex](https://cp-algorithms.com/graph/dijkstra.html)\n    \n- [ ]  [Dijkstra on sparse graphs](https://cp-algorithms.com/graph/dijkstra_sparse.html)\n    \n- [ ]  [Bellman-Ford - finding shortest paths with negative weights](https://cp-algorithms.com/graph/bellman_ford.html)\n    \n- [ ]  [0-1 BFS](https://cp-algorithms.com/graph/01_bfs.html)\n    \n- [ ]  [D´Esopo-Pape algorithm](https://cp-algorithms.com/graph/desopo_pape.html)\n    \n\n- [ ]  All-pairs shortest paths\n    \n\n- [ ]  [Floyd-Warshall - finding all shortest paths](https://cp-algorithms.com/graph/all-pair-shortest-path-floyd-warshall.html)\n    \n- [ ]  [Number of paths of fixed length / Shortest paths of fixed length](https://cp-algorithms.com/graph/fixed_length_paths.html)\n    \n\n- [ ]  Spanning trees\n    \n\n- [ ]  [Minimum Spanning Tree - Prim's Algorithm](https://cp-algorithms.com/graph/mst_prim.html)\n    \n- [ ]  [Minimum Spanning Tree - Kruskal](https://cp-algorithms.com/graph/mst_kruskal.html)\n    \n- [ ]  [Minimum Spanning Tree - Kruskal with Disjoint Set Union](https://cp-algorithms.com/graph/mst_kruskal_with_dsu.html)\n    \n- [ ]  [Second best Minimum Spanning Tree - Using Kruskal and Lowest Common Ancestor](https://cp-algorithms.com/graph/second_best_mst.html)\n    \n- [ ]  [Kirchhoff Theorem](https://cp-algorithms.com/graph/kirchhoff-theorem.html)\n    \n- [ ]  [Prüfer code](https://cp-algorithms.com/graph/pruefer_code.html)\n    \n\n- [ ]  Cycles\n    \n\n- [ ]  [Checking a graph for acyclicity and finding a cycle in O(M)](https://cp-algorithms.com/graph/finding-cycle.html)\n    \n- [ ]  [Finding a Negative Cycle in the Graph](https://cp-algorithms.com/graph/finding-negative-cycle-in-graph.html)\n    \n- [ ]  [Eulerian Path](https://cp-algorithms.com/graph/euler_path.html)\n    \n\n- [ ]  Lowest common ancestor\n    \n\n- [ ]  [Lowest Common Ancestor](https://cp-algorithms.com/graph/lca.html)\n    \n- [ ]  [Lowest Common Ancestor - Binary Lifting](https://cp-algorithms.com/graph/lca_binary_lifting.html)\n    \n- [ ]  [Lowest Common Ancestor - Farach-Colton and Bender algorithm](https://cp-algorithms.com/graph/lca_farachcoltonbender.html)\n    \n- [ ]  [Solve RMQ by finding LCA](https://cp-algorithms.com/graph/rmq_linear.html)\n    \n- [ ]  [Lowest Common Ancestor - Tarjan's off-line algorithm](https://cp-algorithms.com/graph/lca_tarjan.html)\n    \n\n- [ ]  Flows and related problems\n    \n\n- [ ]  [Maximum flow - Ford-Fulkerson and Edmonds-Karp](https://cp-algorithms.com/graph/edmonds_karp.html)\n    \n- [ ]  [Maximum flow - Push-relabel algorithm](https://cp-algorithms.com/graph/push-relabel.html)\n    \n- [ ]  [Maximum flow - Push-relabel algorithm improved](https://cp-algorithms.com/graph/push-relabel-faster.html)\n    \n- [ ]  [Maximum flow - Dinic's algorithm](https://cp-algorithms.com/graph/dinic.html)\n    \n- [ ]  [Maximum flow - MPM algorithm](https://cp-algorithms.com/graph/mpm.html)\n    \n- [ ]  [Flows with demands](https://cp-algorithms.com/graph/flow_with_demands.html)\n    \n- [ ]  [Minimum-cost flow](https://cp-algorithms.com/graph/min_cost_flow.html)\n    \n- [ ]  [Assignment problem. Solution using min-cost-flow in O (N^5)](https://cp-algorithms.com/graph/Assignment-problem-min-flow.html)\n    \n\n- [ ]  Matchings and related problems\n    \n\n- [ ]  [Bipartite Graph Check](https://cp-algorithms.com/graph/bipartite-check.html)\n    \n\n- [ ]  Miscellaneous\n    \n\n- [ ]  [Topological Sorting](https://cp-algorithms.com/graph/topological-sort.html)\n    \n- [ ]  [Edge connectivity / Vertex connectivity](https://cp-algorithms.com/graph/edge_vertex_connectivity.html)\n    \n- [ ]  [Tree painting](https://cp-algorithms.com/graph/tree_painting.html)\n    \n- [ ]  [2-SAT](https://cp-algorithms.com/graph/2SAT.html)\n    \n- [ ]  [Heavy-light decomposition](https://cp-algorithms.com/graph/hld.html)\n    \n\n### Miscellaneous\n\n- [ ]  Sequences\n    \n\n- [ ]  [RMQ task (Range Minimum Query - the smallest element in an interval)](https://cp-algorithms.com/sequences/rmq.html)\n    \n- [ ]  [Longest increasing subsequence](https://cp-algorithms.com/sequences/longest_increasing_subsequence.html)\n    \n- [ ]  [Search the subsegment with the maximum/minimum sum](https://cp-algorithms.com/others/maximum_average_segment.html)\n    \n- [ ]  [K-th order statistic in O(N)](https://cp-algorithms.com/sequences/k-th.html)\n    \n\n- [ ]  Game Theory\n    \n\n- [ ]  [Games on arbitrary graphs](https://cp-algorithms.com/game_theory/games_on_graphs.html)\n    \n- [ ]  [Sprague-Grundy theorem. Nim](https://cp-algorithms.com/game_theory/sprague-grundy-nim.html)\n    \n\n- [ ]  Schedules\n    \n\n- [ ]  [Scheduling jobs on one machine](https://cp-algorithms.com/schedules/schedule_one_machine.html)\n    \n- [ ]  [Scheduling jobs on two machines](https://cp-algorithms.com/schedules/schedule_two_machines.html)\n    \n- [ ]  [Optimal schedule of jobs given their deadlines and durations](https://cp-algorithms.com/schedules/schedule-with-completion-duration.html)\n    \n\n- [ ]  Miscellaneous\n    \n\n- [ ]  [Josephus problem](https://cp-algorithms.com/others/josephus_problem.html)\n    \n- [ ]  [15 Puzzle Game: Existence Of The Solution](https://cp-algorithms.com/others/15-puzzle.html)\n    \n- [ ]  [The Stern-Brocot Tree and Farey Sequences](https://cp-algorithms.com/others/stern_brocot_tree_farey_sequences.html)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fideepika%2Fcode_practice","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fideepika%2Fcode_practice","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fideepika%2Fcode_practice/lists"}