User contributions for Admin
Jump to navigation
Jump to search
6 May 2023
- 05:0505:05, 6 May 2023 diff hist +77 Depth-First Search No edit summary current
- 05:0505:05, 6 May 2023 diff hist +79 Breadth-First Search No edit summary current
- 05:0405:04, 6 May 2023 diff hist +44 Binary Search No edit summary current
- 05:0405:04, 6 May 2023 diff hist 0 N Category:Binary Search Created blank page current
- 05:0305:03, 6 May 2023 diff hist −28 Binary Search No edit summary
- 05:0305:03, 6 May 2023 diff hist +56 Binary Search No edit summary
- 04:5904:59, 6 May 2023 diff hist +4,879 N Binary Search Created page with "== Binary Search == Binary Search is an efficient algorithm for finding a specific element (target) in a sorted array or list. The algorithm works by repeatedly dividing the search interval in half. At each step, the algorithm compares the middle element of the interval with the target value. If the middle element is equal to the target, the search is successful. If the target is less than the middle element, the search continues in the left half of the interval. If the..."
- 04:0304:03, 6 May 2023 diff hist −469 Breadth-First Search →Example C++ code
- 04:0004:00, 6 May 2023 diff hist +247 Breadth-First Search →USACO problems for BFS
- 04:0004:00, 6 May 2023 diff hist +1,907 N Depth-First Search Created page with "== Depth-First Search == Depth-First Search (DFS) is a graph traversal algorithm that explores all the vertices of a graph by visiting nodes as deep as possible before backtracking. DFS can be implemented using recursion or an explicit stack data structure. === Algorithm === Start at the source node and mark it as visited. For each adjacent node of the source node, if it is not visited, perform a recursive DFS from the adjacent node. === Time Complexity ===..."
- 03:5703:57, 6 May 2023 diff hist −313 Breadth-First Search No edit summary
- 03:5503:55, 6 May 2023 diff hist −10 Breadth-First Search →USACO problems for BFS
- 03:5203:52, 6 May 2023 diff hist +320 Breadth-First Search →USACO problems for BFS
- 03:5103:51, 6 May 2023 diff hist +2,821 N Breadth-First Search Created page with "= Breadth-First Search (BFS) = Breadth-First Search (BFS) is an algorithm for searching a tree or graph data structure for a node that meets a set of criteria. It starts at the tree’s root or graph and searches/visits all nodes at the current depth level before moving on to the nodes at the next depth level. <ref name=“geeksforgeeks”>https://www.geeksforgeeks.org/breadth-first-search-or-bfs-for-a-graph/</ref> == How it works == BFS uses a queue data structure to..."
- 03:3703:37, 6 May 2023 diff hist +71 Path to Gold No edit summary
5 May 2023
- 06:0106:01, 5 May 2023 diff hist 0 2014 Jan Silver Problem 2 Cross Country Skiing No edit summary
- 06:0006:00, 5 May 2023 diff hist +675 2014 Jan Silver Problem 2 Cross Country Skiing No edit summary
- 05:5805:58, 5 May 2023 diff hist +34 2014 Jan Silver Problem 2 Cross Country Skiing No edit summary
- 05:5405:54, 5 May 2023 diff hist +139 2014 Jan Silver Problem 2 Cross Country Skiing →Solution
- 05:5005:50, 5 May 2023 diff hist +6,334 2014 Jan Silver Problem 2 Cross Country Skiing →Code
- 05:4505:45, 5 May 2023 diff hist +4,425 2014 Jan Silver Problem 2 Cross Country Skiing No edit summary
- 05:3905:39, 5 May 2023 diff hist 0 N Category:Yearly 2013 2014 Created blank page current
- 05:3805:38, 5 May 2023 diff hist +92 N 2014 Jan Silver Problem 2 Cross Country Skiing Created page with "== Problem == == Solution == == Code == Category:Yearly_2013_2014 Category:Silver"
- 05:3705:37, 5 May 2023 diff hist 0 Main Page →Practicing
- 03:1003:10, 5 May 2023 diff hist −52 Trie No edit summary
- 02:3602:36, 5 May 2023 diff hist +3,361 N Trie Created page with "== Trie == thumb|right|350px|A simple trie for keys "A", "to", "tea", "ted", "ten", "i", "in", and "inn". A '''trie''' (pronounced "try"), also known as a '''prefix tree''' or '''digital tree''', is a tree-like data structure used to store an associative array where the keys are usually strings. Each node in the trie represents a single character in the key, and the root node represents an em..."
- 02:1402:14, 5 May 2023 diff hist +1,961 N Path to Platinum Created page with "== Topics == * Advanced Data Structures ** Range Minimum Query (RMQ) ** Sparse Table ** Heavy-Light Decomposition ** Treap ** Suffix Automaton ** K-Dimensional Tree * Advanced Algorithms ** Advanced Dynamic Programming *** Tree DP *** State Compression DP *** Matrix Exponentiation ** Graph Algorithms *** Minimum Arborescence *** Biconnected Components *** Aho-Corasick Algorithm *** 2-SAT *** Maximal In..." current
- 02:1102:11, 5 May 2023 diff hist +1,807 N Path to Gold Created page with "== Topics == * Advanced Data Structures ** Binary Indexed Trees (Fenwick Trees) ** Segment Trees ** Persistent Data Structures ** Trie ** Suffix Array ** Suffix Tree * Advanced Algorithms ** Dynamic Programming *** Convex Hull Optimization *** Digit DP *** Knapsack Problem ** Graph Algorithms *** Shortest Paths **** Dijkstra's Algorithm **** Bellman-Ford Algorithm **** Floyd-Warshall Algorithm *** Mini..."
- 02:0802:08, 5 May 2023 diff hist +1,339 N Path to Silver Created page with "== Topics == * Variables and Data Types * Input and Output * Control Structures (if, else, switch) * Loops (for, while, do-while) * Functions * Arrays * Strings * Basic Sorting Algorithms (Bubble Sort, Selection Sort, Insertion Sort) * Basic Searching Algorithms (Linear Search, Binary Search) * Basic Data Structures (Stacks, Queues) * Basic Graph Algorithms (Breadth-First Search, Depth-First Search) == Bronze to Silver Practice Questions == * Question 1: [https://www.us..." current
- 02:0302:03, 5 May 2023 diff hist +87 Main Page No edit summary
4 May 2023
- 19:1019:10, 4 May 2023 diff hist +71 Main Page →Resources
- 19:1019:10, 4 May 2023 diff hist +849 N Algorithms Created page with "== Algorithms == === Sorting === * Bubble Sort * Selection Sort * Insertion Sort * Merge Sort * Quick Sort * Heap Sort === Searching === * Linear Search * Binary Search === Graph Algorithms === * Breadth-First Search * Depth-First Search * Dijkstra's Algorithm * Floyd-Warshall Algorithm * Kruskal's Algorithm * Prim's Algorithm * Topological Sort * Bellman-Ford Algorithm === Dynamic Programming..."
- 19:0519:05, 4 May 2023 diff hist +182 N Data Structure Created page with "* Arrays * Linked Lists * Stacks * Queues * Trees * Binary Search Trees * Balanced Trees * Heaps * Hash Tables * Disjoint Set Union * Trie"
- 19:0419:04, 4 May 2023 diff hist +205 N Programming Created page with "== Programming Languages == * Python * C++ * Java == Basic Programming Concepts == * Variables * Control Structures * Loops * Functions * Input and Output * Recursion" current
- 19:0219:02, 4 May 2023 diff hist +12 Main Page No edit summary
- 16:1516:15, 4 May 2023 diff hist +105 Main Page No edit summary
- 16:0616:06, 4 May 2023 diff hist +4 Main Page No edit summary
- 16:0616:06, 4 May 2023 diff hist −643 Main Page No edit summary
- 15:5415:54, 4 May 2023 diff hist 0 N Category:Platinum Created blank page current
- 15:5415:54, 4 May 2023 diff hist 0 N Category:Gold Created blank page current
- 15:5415:54, 4 May 2023 diff hist 0 N Category:Silver Created blank page current
- 15:5415:54, 4 May 2023 diff hist 0 N Category:Bronze Created blank page current
- 15:5315:53, 4 May 2023 diff hist 0 N Category:Yearly 2022 2023 Created blank page current
- 15:5315:53, 4 May 2023 diff hist 0 N Category:Yearly 2021 2022 Created blank page current
- 15:5315:53, 4 May 2023 diff hist 0 N Category:Yearly 2020 2021 Created blank page current
- 15:5315:53, 4 May 2023 diff hist 0 N Category:Yearly 2019 2020 Created blank page current
- 15:5315:53, 4 May 2023 diff hist 0 N Category:Yearly 2018 2019 Created blank page current
- 15:5315:53, 4 May 2023 diff hist 0 N Category:Yearly 2017 2018 Created blank page current
- 15:5215:52, 4 May 2023 diff hist 0 N Category:Yearly 2016 2017 Created blank page current
- 15:5215:52, 4 May 2023 diff hist 0 N Category:Yearly 2015 2016 Created blank page current