| id,category,difficulty,topic,time_complexity,space_complexity,question,description,language | |
| algo_a47_00001,basic,beginner,swap,O(1),O(1),Write an Algorim action to write an algorim action to swap two integers.,Exchange values of two integer variables using a temporary variable.,algorim_a47 | |
| algo_a47_00002,math,beginner,absolute_value,O(1),O(1),Write an Algorim action to write an algorim function to compute the absolute value.,Returns the absolute value of an integer.,algorim_a47 | |
| algo_a47_00003,math,beginner,power,O(exp),O(1),Write an Algorim action to implement a power function in algorim.,Computes base raised to the power of exp using iteration.,algorim_a47 | |
| algo_a47_00004,math,beginner,factorial,O(n),O(1),Write an Algorim action to write the factorial function in algorim.,Computes n! iteratively.,algorim_a47 | |
| algo_a47_00005,recursion,intermediate,factorial_recursive,O(n),O(n),Write an Algorim action to write a recursive factorial function in algorim.,Recursive factorial computation.,algorim_a47 | |
| algo_a47_00006,math,intermediate,fibonacci,O(n),O(1),Write an Algorim action to compute the nth fibonacci number in algorim.,Computes the n-th Fibonacci number iteratively.,algorim_a47 | |
| algo_a47_00007,recursion,intermediate,fibonacci_recursive,O(2^n),O(n),Write an Algorim action to write a recursive fibonacci function in algorim.,Recursive Fibonacci using two recursive calls.,algorim_a47 | |
| algo_a47_00008,math,intermediate,gcd,"O(log(min(a,b)))",O(1),Write an Algorim action to implement gcd using euclidean algorithm in algorim.,Computes GCD using Euclidean algorithm.,algorim_a47 | |
| algo_a47_00009,math,intermediate,lcm,"O(log(min(a,b)))",O(1),Write an Algorim action to write an lcm function in algorim.,Computes LCM using GCD.,algorim_a47 | |
| algo_a47_00010,math,intermediate,primality_test,O(sqrt(n)),O(1),Write an Algorim action to write a primality test in algorim.,Checks if a number is prime using trial division up to sqrt(n).,algorim_a47 | |
| algo_a47_00011,arrays,beginner,array_sum,O(n),O(1),Write an Algorim action to sum all elements of an array in algorim.,Sums all elements of an integer array.,algorim_a47 | |
| algo_a47_00012,arrays,beginner,find_maximum,O(n),O(1),Write an Algorim action to find the maximum element in an array using algorim.,Finds the maximum element in an array.,algorim_a47 | |
| algo_a47_00013,arrays,beginner,find_minimum,O(n),O(1),Write an Algorim action to find the minimum element in an array using algorim.,Finds the minimum element in an array.,algorim_a47 | |
| algo_a47_00014,searching,beginner,linear_search,O(n),O(1),Write an Algorim action to implement linear search in algorim.,"Searches for target in array, returns index or -1.",algorim_a47 | |
| algo_a47_00015,searching,intermediate,binary_search,O(log n),O(1),Write an Algorim action to write binary search in algorim for a sorted array.,Binary search on sorted array. Returns index or -1.,algorim_a47 | |
| algo_a47_00016,arrays,beginner,reverse_array,O(n),O(1),Write an Algorim action to reverse an array in-place in algorim.,Reverses an array in-place using two pointers.,algorim_a47 | |
| algo_a47_00017,arrays,beginner,count_occurrences,O(n),O(1),Write an Algorim action to count occurrences of a value in an array using algorim.,Counts occurrences of val in array T.,algorim_a47 | |
| algo_a47_00018,arrays,beginner,copy_array,O(n),O(1),Write an Algorim action to write an array copy function in algorim.,Copies elements from src to dst array.,algorim_a47 | |
| algo_a47_00019,sorting,beginner,bubble_sort,O(n^2),O(1),Write an Algorim action to implement bubble sort in algorim.,Bubble sort with early exit optimization.,algorim_a47 | |
| algo_a47_00020,sorting,beginner,selection_sort,O(n^2),O(1),Write an Algorim action to implement selection sort in algorim.,Selection sort: finds minimum and places it at front.,algorim_a47 | |
| algo_a47_00021,sorting,intermediate,insertion_sort,O(n^2),O(1),Write an Algorim action to implement insertion sort in algorim.,Insertion sort: builds sorted array one element at a time.,algorim_a47 | |
| algo_a47_00022,sorting,advanced,merge_sort,O(n log n),O(n),Write an Algorim action to implement merge sort in algorim.,Merge sort: divide-and-conquer stable sorting algorithm.,algorim_a47 | |
| algo_a47_00023,sorting,advanced,quick_sort,"O(n log n) avg, O(n^2) worst",O(log n),Write an Algorim action to implement quick sort in algorim.,Quick sort with last element as pivot using Lomuto partition.,algorim_a47 | |
| algo_a47_00024,sorting,advanced,heap_sort,O(n log n),O(1),Write an Algorim action to implement heap sort in algorim.,Heap sort using max-heap.,algorim_a47 | |
| algo_a47_00025,linked_list,intermediate,linked_list_basic,"O(1) front, O(n) back",O(1),Write an Algorim action to implement singly linked list insert front and back in algorim.,Singly linked list node creation and insertion operations.,algorim_a47 | |
| algo_a47_00026,linked_list,intermediate,linked_list_delete,O(n),O(1),Write an Algorim action to delete a node with given value from a singly linked list in algorim.,Delete first occurrence of val from linked list.,algorim_a47 | |
| algo_a47_00027,linked_list,intermediate,reverse_linked_list,O(n),O(1),Write an Algorim action to reverse a singly linked list in algorim.,Reverses a singly linked list in-place.,algorim_a47 | |
| algo_a47_00028,linked_list,beginner,list_length,O(n),O(1),Write an Algorim action to find the length of a linked list in algorim.,Returns the length of a singly linked list.,algorim_a47 | |
| algo_a47_00029,data_structures,intermediate,stack,O(1) all ops,O(n),Write an Algorim action to implement a stack data structure in algorim.,"Stack implementation using array with push, pop, peek, isEmpty.",algorim_a47 | |
| algo_a47_00030,data_structures,intermediate,balanced_parentheses,O(n),O(n),Write an Algorim action to check if an expression has balanced parentheses in algorim.,Checks if parentheses/brackets/braces are balanced using a stack.,algorim_a47 | |
| algo_a47_00031,data_structures,intermediate,queue,O(1) all ops,O(n),Write an Algorim action to implement a circular queue in algorim.,"Circular queue implementation with enqueue, dequeue, isEmpty.",algorim_a47 | |
| algo_a47_00032,trees,intermediate,bst_insert,O(h) where h=height,O(h),Write an Algorim action to implement bst insertion in algorim.,Inserts a key into a Binary Search Tree.,algorim_a47 | |
| algo_a47_00033,trees,intermediate,bst_search,O(h),O(h),Write an Algorim action to search for a key in a bst using algorim.,Searches for a key in a Binary Search Tree.,algorim_a47 | |
| algo_a47_00034,trees,beginner,inorder_traversal,O(n),O(h),Write an Algorim action to write in-order traversal of a binary tree in algorim.,In-order traversal of binary tree (Left-Root-Right).,algorim_a47 | |
| algo_a47_00035,trees,beginner,preorder_traversal,O(n),O(h),Write an Algorim action to write pre-order traversal of a binary tree in algorim.,Pre-order traversal (Root-Left-Right).,algorim_a47 | |
| algo_a47_00036,trees,beginner,postorder_traversal,O(n),O(h),Write an Algorim action to write post-order traversal of a binary tree in algorim.,Post-order traversal (Left-Right-Root).,algorim_a47 | |
| algo_a47_00037,trees,intermediate,tree_height,O(n),O(h),Write an Algorim action to find the height of a binary tree in algorim.,Computes the height (depth) of a binary tree.,algorim_a47 | |
| algo_a47_00038,trees,beginner,count_nodes,O(n),O(h),Write an Algorim action to count the number of nodes in a binary tree in algorim.,Counts total nodes in a binary tree.,algorim_a47 | |
| algo_a47_00039,trees,intermediate,level_order_traversal,O(n),O(w) w=max width,Write an Algorim action to implement level-order (bfs) traversal of a binary tree in algorim.,BFS level-order traversal of binary tree using a queue.,algorim_a47 | |
| algo_a47_00040,graphs,advanced,depth_first_search,O(V+E),O(V),Write an Algorim action to implement depth first search (dfs) in algorim.,DFS graph traversal using adjacency matrix and recursion.,algorim_a47 | |
| algo_a47_00041,graphs,advanced,breadth_first_search,O(V+E),O(V),Write an Algorim action to implement breadth first search (bfs) in algorim.,BFS graph traversal using adjacency matrix and queue.,algorim_a47 | |
| algo_a47_00042,strings,beginner,string_length,O(n),O(1),Write an Algorim action to write a string length function in algorim.,Computes string length by counting until null terminator.,algorim_a47 | |
| algo_a47_00043,strings,beginner,palindrome_check,O(n),O(1),Write an Algorim action to check if a string is a palindrome in algorim.,Checks if a string is a palindrome using two pointers.,algorim_a47 | |
| algo_a47_00044,strings,beginner,string_reverse,O(n),O(1),Write an Algorim action to reverse a string in-place in algorim.,Reverses a string in-place.,algorim_a47 | |
| algo_a47_00045,strings,beginner,string_copy,O(n),O(1),Write an Algorim action to copy a string in algorim.,Copies string src to dst.,algorim_a47 | |
| algo_a47_00046,strings,beginner,count_character,O(n),O(1),Write an Algorim action to count occurrences of a character in a string in algorim.,Counts occurrences of character c in string s.,algorim_a47 | |
| algo_a47_00047,dynamic_programming,advanced,longest_common_subsequence,O(m*n),O(m*n),Write an Algorim action to implement lcs algorithm in algorim.,Finds the length of the Longest Common Subsequence using DP.,algorim_a47 | |
| algo_a47_00048,dynamic_programming,advanced,knapsack_0_1,O(n*W),O(n*W),Write an Algorim action to implement the 0/1 knapsack problem in algorim.,0/1 Knapsack problem using bottom-up DP.,algorim_a47 | |
| algo_a47_00049,dynamic_programming,advanced,coin_change,O(amount * n),O(amount),Write an Algorim action to implement coin change problem in algorim.,Minimum number of coins to make an amount (DP).,algorim_a47 | |
| algo_a47_00050,number_theory,intermediate,sieve_eratosthenes,O(n log log n),O(n),Write an Algorim action to implement the sieve of eratosthenes in algorim.,Sieve of Eratosthenes to find all primes up to n.,algorim_a47 | |
| algo_a47_00051,number_theory,beginner,binary_to_decimal,O(n),O(1),Write an Algorim action to convert binary to decimal in algorim.,Converts binary string to decimal integer.,algorim_a47 | |
| algo_a47_00052,data_structures,advanced,hash_table,"O(1) avg, O(n) worst",O(n),Write an Algorim action to implement a hash table with chaining in algorim.,Hash table with separate chaining collision resolution.,algorim_a47 | |
| algo_a47_00053,matrix,intermediate,matrix_multiplication,O(n^3),O(1) extra,Write an Algorim action to implement matrix multiplication in algorim.,"Multiplies two n×n matrices A and B, stores result in C.",algorim_a47 | |
| algo_a47_00054,matrix,beginner,matrix_transpose,O(n^2),O(1),Write an Algorim action to transpose a matrix in-place in algorim.,Transposes a square matrix in-place.,algorim_a47 | |
| algo_a47_00055,data_structures,advanced,min_heap,O(log n) insert/extract,O(n),Write an Algorim action to implement a min-heap in algorim.,Min-heap with insert and extract_min operations.,algorim_a47 | |
| algo_a47_00056,backtracking,advanced,n_queens,O(n!),O(n^2),Write an Algorim action to solve the n-queens problem in algorim.,N-Queens problem using backtracking.,algorim_a47 | |
| algo_a47_00057,commands,beginner,imagine_command,N/A,N/A,Write an Algorim action to how do you ask the model to generate an image of an algorithm?,Command to generate a visual image of an algorithm or code.,algorim_a47 | |
| algo_a47_00058,commands,intermediate,compile_command,N/A,N/A,Write an Algorim action to how do you compile an algorim function to machine code?,Command to compile Algorim code to executable bytecode.,algorim_a47 | |
| algo_a47_00059,commands,intermediate,debug_command,N/A,N/A,Write an Algorim action to how do you debug an algorim function step by step?,Command to debug Algorim code with execution trace.,algorim_a47 | |
| algo_a47_00060,basic,beginner,swap,O(1),O(1),Implement in Algorim language: write an algorim action to swap two integers.,Exchange values of two integer variables using a temporary variable.,algorim_a47 | |
| algo_a47_00061,math,beginner,absolute_value,O(1),O(1),Implement in Algorim language: write an algorim function to compute the absolute value.,Returns the absolute value of an integer.,algorim_a47 | |
| algo_a47_00062,math,beginner,power,O(exp),O(1),Implement in Algorim language: implement a power function in algorim.,Computes base raised to the power of exp using iteration.,algorim_a47 | |
| algo_a47_00063,math,beginner,factorial,O(n),O(1),Implement in Algorim language: write the factorial function in algorim.,Computes n! iteratively.,algorim_a47 | |
| algo_a47_00064,recursion,intermediate,factorial_recursive,O(n),O(n),Implement in Algorim language: write a recursive factorial function in algorim.,Recursive factorial computation.,algorim_a47 | |
| algo_a47_00065,math,intermediate,fibonacci,O(n),O(1),Implement in Algorim language: compute the nth fibonacci number in algorim.,Computes the n-th Fibonacci number iteratively.,algorim_a47 | |
| algo_a47_00066,recursion,intermediate,fibonacci_recursive,O(2^n),O(n),Implement in Algorim language: write a recursive fibonacci function in algorim.,Recursive Fibonacci using two recursive calls.,algorim_a47 | |
| algo_a47_00067,math,intermediate,gcd,"O(log(min(a,b)))",O(1),Implement in Algorim language: implement gcd using euclidean algorithm in algorim.,Computes GCD using Euclidean algorithm.,algorim_a47 | |
| algo_a47_00068,math,intermediate,lcm,"O(log(min(a,b)))",O(1),Implement in Algorim language: write an lcm function in algorim.,Computes LCM using GCD.,algorim_a47 | |
| algo_a47_00069,math,intermediate,primality_test,O(sqrt(n)),O(1),Implement in Algorim language: write a primality test in algorim.,Checks if a number is prime using trial division up to sqrt(n).,algorim_a47 | |
| algo_a47_00070,arrays,beginner,array_sum,O(n),O(1),Implement in Algorim language: sum all elements of an array in algorim.,Sums all elements of an integer array.,algorim_a47 | |
| algo_a47_00071,arrays,beginner,find_maximum,O(n),O(1),Implement in Algorim language: find the maximum element in an array using algorim.,Finds the maximum element in an array.,algorim_a47 | |
| algo_a47_00072,arrays,beginner,find_minimum,O(n),O(1),Implement in Algorim language: find the minimum element in an array using algorim.,Finds the minimum element in an array.,algorim_a47 | |
| algo_a47_00073,searching,beginner,linear_search,O(n),O(1),Implement in Algorim language: implement linear search in algorim.,"Searches for target in array, returns index or -1.",algorim_a47 | |
| algo_a47_00074,searching,intermediate,binary_search,O(log n),O(1),Implement in Algorim language: write binary search in algorim for a sorted array.,Binary search on sorted array. Returns index or -1.,algorim_a47 | |
| algo_a47_00075,arrays,beginner,reverse_array,O(n),O(1),Implement in Algorim language: reverse an array in-place in algorim.,Reverses an array in-place using two pointers.,algorim_a47 | |
| algo_a47_00076,arrays,beginner,count_occurrences,O(n),O(1),Implement in Algorim language: count occurrences of a value in an array using algorim.,Counts occurrences of val in array T.,algorim_a47 | |
| algo_a47_00077,arrays,beginner,copy_array,O(n),O(1),Implement in Algorim language: write an array copy function in algorim.,Copies elements from src to dst array.,algorim_a47 | |
| algo_a47_00078,sorting,beginner,bubble_sort,O(n^2),O(1),Implement in Algorim language: implement bubble sort in algorim.,Bubble sort with early exit optimization.,algorim_a47 | |
| algo_a47_00079,sorting,beginner,selection_sort,O(n^2),O(1),Implement in Algorim language: implement selection sort in algorim.,Selection sort: finds minimum and places it at front.,algorim_a47 | |
| algo_a47_00080,sorting,intermediate,insertion_sort,O(n^2),O(1),Implement in Algorim language: implement insertion sort in algorim.,Insertion sort: builds sorted array one element at a time.,algorim_a47 | |
| algo_a47_00081,sorting,advanced,merge_sort,O(n log n),O(n),Implement in Algorim language: implement merge sort in algorim.,Merge sort: divide-and-conquer stable sorting algorithm.,algorim_a47 | |
| algo_a47_00082,sorting,advanced,quick_sort,"O(n log n) avg, O(n^2) worst",O(log n),Implement in Algorim language: implement quick sort in algorim.,Quick sort with last element as pivot using Lomuto partition.,algorim_a47 | |
| algo_a47_00083,sorting,advanced,heap_sort,O(n log n),O(1),Implement in Algorim language: implement heap sort in algorim.,Heap sort using max-heap.,algorim_a47 | |
| algo_a47_00084,linked_list,intermediate,linked_list_basic,"O(1) front, O(n) back",O(1),Implement in Algorim language: implement singly linked list insert front and back in algorim.,Singly linked list node creation and insertion operations.,algorim_a47 | |
| algo_a47_00085,linked_list,intermediate,linked_list_delete,O(n),O(1),Implement in Algorim language: delete a node with given value from a singly linked list in algorim.,Delete first occurrence of val from linked list.,algorim_a47 | |
| algo_a47_00086,linked_list,intermediate,reverse_linked_list,O(n),O(1),Implement in Algorim language: reverse a singly linked list in algorim.,Reverses a singly linked list in-place.,algorim_a47 | |
| algo_a47_00087,linked_list,beginner,list_length,O(n),O(1),Implement in Algorim language: find the length of a linked list in algorim.,Returns the length of a singly linked list.,algorim_a47 | |
| algo_a47_00088,data_structures,intermediate,stack,O(1) all ops,O(n),Implement in Algorim language: implement a stack data structure in algorim.,"Stack implementation using array with push, pop, peek, isEmpty.",algorim_a47 | |
| algo_a47_00089,data_structures,intermediate,balanced_parentheses,O(n),O(n),Implement in Algorim language: check if an expression has balanced parentheses in algorim.,Checks if parentheses/brackets/braces are balanced using a stack.,algorim_a47 | |
| algo_a47_00090,data_structures,intermediate,queue,O(1) all ops,O(n),Implement in Algorim language: implement a circular queue in algorim.,"Circular queue implementation with enqueue, dequeue, isEmpty.",algorim_a47 | |
| algo_a47_00091,trees,intermediate,bst_insert,O(h) where h=height,O(h),Implement in Algorim language: implement bst insertion in algorim.,Inserts a key into a Binary Search Tree.,algorim_a47 | |
| algo_a47_00092,trees,intermediate,bst_search,O(h),O(h),Implement in Algorim language: search for a key in a bst using algorim.,Searches for a key in a Binary Search Tree.,algorim_a47 | |
| algo_a47_00093,trees,beginner,inorder_traversal,O(n),O(h),Implement in Algorim language: write in-order traversal of a binary tree in algorim.,In-order traversal of binary tree (Left-Root-Right).,algorim_a47 | |
| algo_a47_00094,trees,beginner,preorder_traversal,O(n),O(h),Implement in Algorim language: write pre-order traversal of a binary tree in algorim.,Pre-order traversal (Root-Left-Right).,algorim_a47 | |
| algo_a47_00095,trees,beginner,postorder_traversal,O(n),O(h),Implement in Algorim language: write post-order traversal of a binary tree in algorim.,Post-order traversal (Left-Right-Root).,algorim_a47 | |
| algo_a47_00096,trees,intermediate,tree_height,O(n),O(h),Implement in Algorim language: find the height of a binary tree in algorim.,Computes the height (depth) of a binary tree.,algorim_a47 | |
| algo_a47_00097,trees,beginner,count_nodes,O(n),O(h),Implement in Algorim language: count the number of nodes in a binary tree in algorim.,Counts total nodes in a binary tree.,algorim_a47 | |
| algo_a47_00098,trees,intermediate,level_order_traversal,O(n),O(w) w=max width,Implement in Algorim language: implement level-order (bfs) traversal of a binary tree in algorim.,BFS level-order traversal of binary tree using a queue.,algorim_a47 | |
| algo_a47_00099,graphs,advanced,depth_first_search,O(V+E),O(V),Implement in Algorim language: implement depth first search (dfs) in algorim.,DFS graph traversal using adjacency matrix and recursion.,algorim_a47 | |
| algo_a47_00100,graphs,advanced,breadth_first_search,O(V+E),O(V),Implement in Algorim language: implement breadth first search (bfs) in algorim.,BFS graph traversal using adjacency matrix and queue.,algorim_a47 | |
| algo_a47_00101,strings,beginner,string_length,O(n),O(1),Implement in Algorim language: write a string length function in algorim.,Computes string length by counting until null terminator.,algorim_a47 | |
| algo_a47_00102,strings,beginner,palindrome_check,O(n),O(1),Implement in Algorim language: check if a string is a palindrome in algorim.,Checks if a string is a palindrome using two pointers.,algorim_a47 | |
| algo_a47_00103,strings,beginner,string_reverse,O(n),O(1),Implement in Algorim language: reverse a string in-place in algorim.,Reverses a string in-place.,algorim_a47 | |
| algo_a47_00104,strings,beginner,string_copy,O(n),O(1),Implement in Algorim language: copy a string in algorim.,Copies string src to dst.,algorim_a47 | |
| algo_a47_00105,strings,beginner,count_character,O(n),O(1),Implement in Algorim language: count occurrences of a character in a string in algorim.,Counts occurrences of character c in string s.,algorim_a47 | |
| algo_a47_00106,dynamic_programming,advanced,longest_common_subsequence,O(m*n),O(m*n),Implement in Algorim language: implement lcs algorithm in algorim.,Finds the length of the Longest Common Subsequence using DP.,algorim_a47 | |
| algo_a47_00107,dynamic_programming,advanced,knapsack_0_1,O(n*W),O(n*W),Implement in Algorim language: implement the 0/1 knapsack problem in algorim.,0/1 Knapsack problem using bottom-up DP.,algorim_a47 | |
| algo_a47_00108,dynamic_programming,advanced,coin_change,O(amount * n),O(amount),Implement in Algorim language: implement coin change problem in algorim.,Minimum number of coins to make an amount (DP).,algorim_a47 | |
| algo_a47_00109,number_theory,intermediate,sieve_eratosthenes,O(n log log n),O(n),Implement in Algorim language: implement the sieve of eratosthenes in algorim.,Sieve of Eratosthenes to find all primes up to n.,algorim_a47 | |
| algo_a47_00110,number_theory,beginner,binary_to_decimal,O(n),O(1),Implement in Algorim language: convert binary to decimal in algorim.,Converts binary string to decimal integer.,algorim_a47 | |
| algo_a47_00111,data_structures,advanced,hash_table,"O(1) avg, O(n) worst",O(n),Implement in Algorim language: implement a hash table with chaining in algorim.,Hash table with separate chaining collision resolution.,algorim_a47 | |
| algo_a47_00112,matrix,intermediate,matrix_multiplication,O(n^3),O(1) extra,Implement in Algorim language: implement matrix multiplication in algorim.,"Multiplies two n×n matrices A and B, stores result in C.",algorim_a47 | |
| algo_a47_00113,matrix,beginner,matrix_transpose,O(n^2),O(1),Implement in Algorim language: transpose a matrix in-place in algorim.,Transposes a square matrix in-place.,algorim_a47 | |
| algo_a47_00114,data_structures,advanced,min_heap,O(log n) insert/extract,O(n),Implement in Algorim language: implement a min-heap in algorim.,Min-heap with insert and extract_min operations.,algorim_a47 | |
| algo_a47_00115,backtracking,advanced,n_queens,O(n!),O(n^2),Implement in Algorim language: solve the n-queens problem in algorim.,N-Queens problem using backtracking.,algorim_a47 | |
| algo_a47_00116,commands,beginner,imagine_command,N/A,N/A,Implement in Algorim language: how do you ask the model to generate an image of an algorithm?,Command to generate a visual image of an algorithm or code.,algorim_a47 | |
| algo_a47_00117,commands,intermediate,compile_command,N/A,N/A,Implement in Algorim language: how do you compile an algorim function to machine code?,Command to compile Algorim code to executable bytecode.,algorim_a47 | |
| algo_a47_00118,commands,intermediate,debug_command,N/A,N/A,Implement in Algorim language: how do you debug an algorim function step by step?,Command to debug Algorim code with execution trace.,algorim_a47 | |
| algo_a47_00119,basic,beginner,swap,O(1),O(1),Code the following in Algorim (algo a47): write an algorim action to swap two integers.,Exchange values of two integer variables using a temporary variable.,algorim_a47 | |
| algo_a47_00120,math,beginner,absolute_value,O(1),O(1),Code the following in Algorim (algo a47): write an algorim function to compute the absolute value.,Returns the absolute value of an integer.,algorim_a47 | |
| algo_a47_00121,math,beginner,power,O(exp),O(1),Code the following in Algorim (algo a47): implement a power function in algorim.,Computes base raised to the power of exp using iteration.,algorim_a47 | |
| algo_a47_00122,math,beginner,factorial,O(n),O(1),Code the following in Algorim (algo a47): write the factorial function in algorim.,Computes n! iteratively.,algorim_a47 | |
| algo_a47_00123,recursion,intermediate,factorial_recursive,O(n),O(n),Code the following in Algorim (algo a47): write a recursive factorial function in algorim.,Recursive factorial computation.,algorim_a47 | |
| algo_a47_00124,math,intermediate,fibonacci,O(n),O(1),Code the following in Algorim (algo a47): compute the nth fibonacci number in algorim.,Computes the n-th Fibonacci number iteratively.,algorim_a47 | |
| algo_a47_00125,recursion,intermediate,fibonacci_recursive,O(2^n),O(n),Code the following in Algorim (algo a47): write a recursive fibonacci function in algorim.,Recursive Fibonacci using two recursive calls.,algorim_a47 | |
| algo_a47_00126,math,intermediate,gcd,"O(log(min(a,b)))",O(1),Code the following in Algorim (algo a47): implement gcd using euclidean algorithm in algorim.,Computes GCD using Euclidean algorithm.,algorim_a47 | |
| algo_a47_00127,math,intermediate,lcm,"O(log(min(a,b)))",O(1),Code the following in Algorim (algo a47): write an lcm function in algorim.,Computes LCM using GCD.,algorim_a47 | |
| algo_a47_00128,math,intermediate,primality_test,O(sqrt(n)),O(1),Code the following in Algorim (algo a47): write a primality test in algorim.,Checks if a number is prime using trial division up to sqrt(n).,algorim_a47 | |
| algo_a47_00129,arrays,beginner,array_sum,O(n),O(1),Code the following in Algorim (algo a47): sum all elements of an array in algorim.,Sums all elements of an integer array.,algorim_a47 | |
| algo_a47_00130,arrays,beginner,find_maximum,O(n),O(1),Code the following in Algorim (algo a47): find the maximum element in an array using algorim.,Finds the maximum element in an array.,algorim_a47 | |
| algo_a47_00131,arrays,beginner,find_minimum,O(n),O(1),Code the following in Algorim (algo a47): find the minimum element in an array using algorim.,Finds the minimum element in an array.,algorim_a47 | |
| algo_a47_00132,searching,beginner,linear_search,O(n),O(1),Code the following in Algorim (algo a47): implement linear search in algorim.,"Searches for target in array, returns index or -1.",algorim_a47 | |
| algo_a47_00133,searching,intermediate,binary_search,O(log n),O(1),Code the following in Algorim (algo a47): write binary search in algorim for a sorted array.,Binary search on sorted array. Returns index or -1.,algorim_a47 | |
| algo_a47_00134,arrays,beginner,reverse_array,O(n),O(1),Code the following in Algorim (algo a47): reverse an array in-place in algorim.,Reverses an array in-place using two pointers.,algorim_a47 | |
| algo_a47_00135,arrays,beginner,count_occurrences,O(n),O(1),Code the following in Algorim (algo a47): count occurrences of a value in an array using algorim.,Counts occurrences of val in array T.,algorim_a47 | |
| algo_a47_00136,arrays,beginner,copy_array,O(n),O(1),Code the following in Algorim (algo a47): write an array copy function in algorim.,Copies elements from src to dst array.,algorim_a47 | |
| algo_a47_00137,sorting,beginner,bubble_sort,O(n^2),O(1),Code the following in Algorim (algo a47): implement bubble sort in algorim.,Bubble sort with early exit optimization.,algorim_a47 | |
| algo_a47_00138,sorting,beginner,selection_sort,O(n^2),O(1),Code the following in Algorim (algo a47): implement selection sort in algorim.,Selection sort: finds minimum and places it at front.,algorim_a47 | |
| algo_a47_00139,sorting,intermediate,insertion_sort,O(n^2),O(1),Code the following in Algorim (algo a47): implement insertion sort in algorim.,Insertion sort: builds sorted array one element at a time.,algorim_a47 | |
| algo_a47_00140,sorting,advanced,merge_sort,O(n log n),O(n),Code the following in Algorim (algo a47): implement merge sort in algorim.,Merge sort: divide-and-conquer stable sorting algorithm.,algorim_a47 | |
| algo_a47_00141,sorting,advanced,quick_sort,"O(n log n) avg, O(n^2) worst",O(log n),Code the following in Algorim (algo a47): implement quick sort in algorim.,Quick sort with last element as pivot using Lomuto partition.,algorim_a47 | |
| algo_a47_00142,sorting,advanced,heap_sort,O(n log n),O(1),Code the following in Algorim (algo a47): implement heap sort in algorim.,Heap sort using max-heap.,algorim_a47 | |
| algo_a47_00143,linked_list,intermediate,linked_list_basic,"O(1) front, O(n) back",O(1),Code the following in Algorim (algo a47): implement singly linked list insert front and back in algorim.,Singly linked list node creation and insertion operations.,algorim_a47 | |
| algo_a47_00144,linked_list,intermediate,linked_list_delete,O(n),O(1),Code the following in Algorim (algo a47): delete a node with given value from a singly linked list in algorim.,Delete first occurrence of val from linked list.,algorim_a47 | |
| algo_a47_00145,linked_list,intermediate,reverse_linked_list,O(n),O(1),Code the following in Algorim (algo a47): reverse a singly linked list in algorim.,Reverses a singly linked list in-place.,algorim_a47 | |
| algo_a47_00146,linked_list,beginner,list_length,O(n),O(1),Code the following in Algorim (algo a47): find the length of a linked list in algorim.,Returns the length of a singly linked list.,algorim_a47 | |
| algo_a47_00147,data_structures,intermediate,stack,O(1) all ops,O(n),Code the following in Algorim (algo a47): implement a stack data structure in algorim.,"Stack implementation using array with push, pop, peek, isEmpty.",algorim_a47 | |
| algo_a47_00148,data_structures,intermediate,balanced_parentheses,O(n),O(n),Code the following in Algorim (algo a47): check if an expression has balanced parentheses in algorim.,Checks if parentheses/brackets/braces are balanced using a stack.,algorim_a47 | |
| algo_a47_00149,data_structures,intermediate,queue,O(1) all ops,O(n),Code the following in Algorim (algo a47): implement a circular queue in algorim.,"Circular queue implementation with enqueue, dequeue, isEmpty.",algorim_a47 | |
| algo_a47_00150,trees,intermediate,bst_insert,O(h) where h=height,O(h),Code the following in Algorim (algo a47): implement bst insertion in algorim.,Inserts a key into a Binary Search Tree.,algorim_a47 | |
| algo_a47_00151,trees,intermediate,bst_search,O(h),O(h),Code the following in Algorim (algo a47): search for a key in a bst using algorim.,Searches for a key in a Binary Search Tree.,algorim_a47 | |
| algo_a47_00152,trees,beginner,inorder_traversal,O(n),O(h),Code the following in Algorim (algo a47): write in-order traversal of a binary tree in algorim.,In-order traversal of binary tree (Left-Root-Right).,algorim_a47 | |
| algo_a47_00153,trees,beginner,preorder_traversal,O(n),O(h),Code the following in Algorim (algo a47): write pre-order traversal of a binary tree in algorim.,Pre-order traversal (Root-Left-Right).,algorim_a47 | |
| algo_a47_00154,trees,beginner,postorder_traversal,O(n),O(h),Code the following in Algorim (algo a47): write post-order traversal of a binary tree in algorim.,Post-order traversal (Left-Right-Root).,algorim_a47 | |
| algo_a47_00155,trees,intermediate,tree_height,O(n),O(h),Code the following in Algorim (algo a47): find the height of a binary tree in algorim.,Computes the height (depth) of a binary tree.,algorim_a47 | |
| algo_a47_00156,trees,beginner,count_nodes,O(n),O(h),Code the following in Algorim (algo a47): count the number of nodes in a binary tree in algorim.,Counts total nodes in a binary tree.,algorim_a47 | |
| algo_a47_00157,trees,intermediate,level_order_traversal,O(n),O(w) w=max width,Code the following in Algorim (algo a47): implement level-order (bfs) traversal of a binary tree in algorim.,BFS level-order traversal of binary tree using a queue.,algorim_a47 | |
| algo_a47_00158,graphs,advanced,depth_first_search,O(V+E),O(V),Code the following in Algorim (algo a47): implement depth first search (dfs) in algorim.,DFS graph traversal using adjacency matrix and recursion.,algorim_a47 | |
| algo_a47_00159,graphs,advanced,breadth_first_search,O(V+E),O(V),Code the following in Algorim (algo a47): implement breadth first search (bfs) in algorim.,BFS graph traversal using adjacency matrix and queue.,algorim_a47 | |
| algo_a47_00160,strings,beginner,string_length,O(n),O(1),Code the following in Algorim (algo a47): write a string length function in algorim.,Computes string length by counting until null terminator.,algorim_a47 | |
| algo_a47_00161,strings,beginner,palindrome_check,O(n),O(1),Code the following in Algorim (algo a47): check if a string is a palindrome in algorim.,Checks if a string is a palindrome using two pointers.,algorim_a47 | |
| algo_a47_00162,strings,beginner,string_reverse,O(n),O(1),Code the following in Algorim (algo a47): reverse a string in-place in algorim.,Reverses a string in-place.,algorim_a47 | |
| algo_a47_00163,strings,beginner,string_copy,O(n),O(1),Code the following in Algorim (algo a47): copy a string in algorim.,Copies string src to dst.,algorim_a47 | |
| algo_a47_00164,strings,beginner,count_character,O(n),O(1),Code the following in Algorim (algo a47): count occurrences of a character in a string in algorim.,Counts occurrences of character c in string s.,algorim_a47 | |
| algo_a47_00165,dynamic_programming,advanced,longest_common_subsequence,O(m*n),O(m*n),Code the following in Algorim (algo a47): implement lcs algorithm in algorim.,Finds the length of the Longest Common Subsequence using DP.,algorim_a47 | |
| algo_a47_00166,dynamic_programming,advanced,knapsack_0_1,O(n*W),O(n*W),Code the following in Algorim (algo a47): implement the 0/1 knapsack problem in algorim.,0/1 Knapsack problem using bottom-up DP.,algorim_a47 | |
| algo_a47_00167,dynamic_programming,advanced,coin_change,O(amount * n),O(amount),Code the following in Algorim (algo a47): implement coin change problem in algorim.,Minimum number of coins to make an amount (DP).,algorim_a47 | |
| algo_a47_00168,number_theory,intermediate,sieve_eratosthenes,O(n log log n),O(n),Code the following in Algorim (algo a47): implement the sieve of eratosthenes in algorim.,Sieve of Eratosthenes to find all primes up to n.,algorim_a47 | |
| algo_a47_00169,number_theory,beginner,binary_to_decimal,O(n),O(1),Code the following in Algorim (algo a47): convert binary to decimal in algorim.,Converts binary string to decimal integer.,algorim_a47 | |
| algo_a47_00170,data_structures,advanced,hash_table,"O(1) avg, O(n) worst",O(n),Code the following in Algorim (algo a47): implement a hash table with chaining in algorim.,Hash table with separate chaining collision resolution.,algorim_a47 | |
| algo_a47_00171,matrix,intermediate,matrix_multiplication,O(n^3),O(1) extra,Code the following in Algorim (algo a47): implement matrix multiplication in algorim.,"Multiplies two n×n matrices A and B, stores result in C.",algorim_a47 | |
| algo_a47_00172,matrix,beginner,matrix_transpose,O(n^2),O(1),Code the following in Algorim (algo a47): transpose a matrix in-place in algorim.,Transposes a square matrix in-place.,algorim_a47 | |
| algo_a47_00173,data_structures,advanced,min_heap,O(log n) insert/extract,O(n),Code the following in Algorim (algo a47): implement a min-heap in algorim.,Min-heap with insert and extract_min operations.,algorim_a47 | |
| algo_a47_00174,backtracking,advanced,n_queens,O(n!),O(n^2),Code the following in Algorim (algo a47): solve the n-queens problem in algorim.,N-Queens problem using backtracking.,algorim_a47 | |
| algo_a47_00175,commands,beginner,imagine_command,N/A,N/A,Code the following in Algorim (algo a47): how do you ask the model to generate an image of an algorithm?,Command to generate a visual image of an algorithm or code.,algorim_a47 | |
| algo_a47_00176,commands,intermediate,compile_command,N/A,N/A,Code the following in Algorim (algo a47): how do you compile an algorim function to machine code?,Command to compile Algorim code to executable bytecode.,algorim_a47 | |
| algo_a47_00177,commands,intermediate,debug_command,N/A,N/A,Code the following in Algorim (algo a47): how do you debug an algorim function step by step?,Command to debug Algorim code with execution trace.,algorim_a47 | |
| algo_a47_00178,basic,beginner,swap,O(1),O(1),"Using Algorim pseudocode syntax, write write an algorim action to swap two integers.",Exchange values of two integer variables using a temporary variable.,algorim_a47 | |
| algo_a47_00179,math,beginner,absolute_value,O(1),O(1),"Using Algorim pseudocode syntax, write write an algorim function to compute the absolute value.",Returns the absolute value of an integer.,algorim_a47 | |
| algo_a47_00180,math,beginner,power,O(exp),O(1),"Using Algorim pseudocode syntax, write implement a power function in algorim.",Computes base raised to the power of exp using iteration.,algorim_a47 | |
| algo_a47_00181,math,beginner,factorial,O(n),O(1),"Using Algorim pseudocode syntax, write write the factorial function in algorim.",Computes n! iteratively.,algorim_a47 | |
| algo_a47_00182,recursion,intermediate,factorial_recursive,O(n),O(n),"Using Algorim pseudocode syntax, write write a recursive factorial function in algorim.",Recursive factorial computation.,algorim_a47 | |
| algo_a47_00183,math,intermediate,fibonacci,O(n),O(1),"Using Algorim pseudocode syntax, write compute the nth fibonacci number in algorim.",Computes the n-th Fibonacci number iteratively.,algorim_a47 | |
| algo_a47_00184,recursion,intermediate,fibonacci_recursive,O(2^n),O(n),"Using Algorim pseudocode syntax, write write a recursive fibonacci function in algorim.",Recursive Fibonacci using two recursive calls.,algorim_a47 | |
| algo_a47_00185,math,intermediate,gcd,"O(log(min(a,b)))",O(1),"Using Algorim pseudocode syntax, write implement gcd using euclidean algorithm in algorim.",Computes GCD using Euclidean algorithm.,algorim_a47 | |
| algo_a47_00186,math,intermediate,lcm,"O(log(min(a,b)))",O(1),"Using Algorim pseudocode syntax, write write an lcm function in algorim.",Computes LCM using GCD.,algorim_a47 | |
| algo_a47_00187,math,intermediate,primality_test,O(sqrt(n)),O(1),"Using Algorim pseudocode syntax, write write a primality test in algorim.",Checks if a number is prime using trial division up to sqrt(n).,algorim_a47 | |
| algo_a47_00188,arrays,beginner,array_sum,O(n),O(1),"Using Algorim pseudocode syntax, write sum all elements of an array in algorim.",Sums all elements of an integer array.,algorim_a47 | |
| algo_a47_00189,arrays,beginner,find_maximum,O(n),O(1),"Using Algorim pseudocode syntax, write find the maximum element in an array using algorim.",Finds the maximum element in an array.,algorim_a47 | |
| algo_a47_00190,arrays,beginner,find_minimum,O(n),O(1),"Using Algorim pseudocode syntax, write find the minimum element in an array using algorim.",Finds the minimum element in an array.,algorim_a47 | |
| algo_a47_00191,searching,beginner,linear_search,O(n),O(1),"Using Algorim pseudocode syntax, write implement linear search in algorim.","Searches for target in array, returns index or -1.",algorim_a47 | |
| algo_a47_00192,searching,intermediate,binary_search,O(log n),O(1),"Using Algorim pseudocode syntax, write write binary search in algorim for a sorted array.",Binary search on sorted array. Returns index or -1.,algorim_a47 | |
| algo_a47_00193,arrays,beginner,reverse_array,O(n),O(1),"Using Algorim pseudocode syntax, write reverse an array in-place in algorim.",Reverses an array in-place using two pointers.,algorim_a47 | |
| algo_a47_00194,arrays,beginner,count_occurrences,O(n),O(1),"Using Algorim pseudocode syntax, write count occurrences of a value in an array using algorim.",Counts occurrences of val in array T.,algorim_a47 | |
| algo_a47_00195,arrays,beginner,copy_array,O(n),O(1),"Using Algorim pseudocode syntax, write write an array copy function in algorim.",Copies elements from src to dst array.,algorim_a47 | |
| algo_a47_00196,sorting,beginner,bubble_sort,O(n^2),O(1),"Using Algorim pseudocode syntax, write implement bubble sort in algorim.",Bubble sort with early exit optimization.,algorim_a47 | |
| algo_a47_00197,sorting,beginner,selection_sort,O(n^2),O(1),"Using Algorim pseudocode syntax, write implement selection sort in algorim.",Selection sort: finds minimum and places it at front.,algorim_a47 | |
| algo_a47_00198,sorting,intermediate,insertion_sort,O(n^2),O(1),"Using Algorim pseudocode syntax, write implement insertion sort in algorim.",Insertion sort: builds sorted array one element at a time.,algorim_a47 | |
| algo_a47_00199,sorting,advanced,merge_sort,O(n log n),O(n),"Using Algorim pseudocode syntax, write implement merge sort in algorim.",Merge sort: divide-and-conquer stable sorting algorithm.,algorim_a47 | |
| algo_a47_00200,sorting,advanced,quick_sort,"O(n log n) avg, O(n^2) worst",O(log n),"Using Algorim pseudocode syntax, write implement quick sort in algorim.",Quick sort with last element as pivot using Lomuto partition.,algorim_a47 | |
| algo_a47_00201,sorting,advanced,heap_sort,O(n log n),O(1),"Using Algorim pseudocode syntax, write implement heap sort in algorim.",Heap sort using max-heap.,algorim_a47 | |
| algo_a47_00202,linked_list,intermediate,linked_list_basic,"O(1) front, O(n) back",O(1),"Using Algorim pseudocode syntax, write implement singly linked list insert front and back in algorim.",Singly linked list node creation and insertion operations.,algorim_a47 | |
| algo_a47_00203,linked_list,intermediate,linked_list_delete,O(n),O(1),"Using Algorim pseudocode syntax, write delete a node with given value from a singly linked list in algorim.",Delete first occurrence of val from linked list.,algorim_a47 | |
| algo_a47_00204,linked_list,intermediate,reverse_linked_list,O(n),O(1),"Using Algorim pseudocode syntax, write reverse a singly linked list in algorim.",Reverses a singly linked list in-place.,algorim_a47 | |
| algo_a47_00205,linked_list,beginner,list_length,O(n),O(1),"Using Algorim pseudocode syntax, write find the length of a linked list in algorim.",Returns the length of a singly linked list.,algorim_a47 | |
| algo_a47_00206,data_structures,intermediate,stack,O(1) all ops,O(n),"Using Algorim pseudocode syntax, write implement a stack data structure in algorim.","Stack implementation using array with push, pop, peek, isEmpty.",algorim_a47 | |
| algo_a47_00207,data_structures,intermediate,balanced_parentheses,O(n),O(n),"Using Algorim pseudocode syntax, write check if an expression has balanced parentheses in algorim.",Checks if parentheses/brackets/braces are balanced using a stack.,algorim_a47 | |
| algo_a47_00208,data_structures,intermediate,queue,O(1) all ops,O(n),"Using Algorim pseudocode syntax, write implement a circular queue in algorim.","Circular queue implementation with enqueue, dequeue, isEmpty.",algorim_a47 | |
| algo_a47_00209,trees,intermediate,bst_insert,O(h) where h=height,O(h),"Using Algorim pseudocode syntax, write implement bst insertion in algorim.",Inserts a key into a Binary Search Tree.,algorim_a47 | |
| algo_a47_00210,trees,intermediate,bst_search,O(h),O(h),"Using Algorim pseudocode syntax, write search for a key in a bst using algorim.",Searches for a key in a Binary Search Tree.,algorim_a47 | |
| algo_a47_00211,trees,beginner,inorder_traversal,O(n),O(h),"Using Algorim pseudocode syntax, write write in-order traversal of a binary tree in algorim.",In-order traversal of binary tree (Left-Root-Right).,algorim_a47 | |
| algo_a47_00212,trees,beginner,preorder_traversal,O(n),O(h),"Using Algorim pseudocode syntax, write write pre-order traversal of a binary tree in algorim.",Pre-order traversal (Root-Left-Right).,algorim_a47 | |
| algo_a47_00213,trees,beginner,postorder_traversal,O(n),O(h),"Using Algorim pseudocode syntax, write write post-order traversal of a binary tree in algorim.",Post-order traversal (Left-Right-Root).,algorim_a47 | |
| algo_a47_00214,trees,intermediate,tree_height,O(n),O(h),"Using Algorim pseudocode syntax, write find the height of a binary tree in algorim.",Computes the height (depth) of a binary tree.,algorim_a47 | |
| algo_a47_00215,trees,beginner,count_nodes,O(n),O(h),"Using Algorim pseudocode syntax, write count the number of nodes in a binary tree in algorim.",Counts total nodes in a binary tree.,algorim_a47 | |
| algo_a47_00216,trees,intermediate,level_order_traversal,O(n),O(w) w=max width,"Using Algorim pseudocode syntax, write implement level-order (bfs) traversal of a binary tree in algorim.",BFS level-order traversal of binary tree using a queue.,algorim_a47 | |
| algo_a47_00217,graphs,advanced,depth_first_search,O(V+E),O(V),"Using Algorim pseudocode syntax, write implement depth first search (dfs) in algorim.",DFS graph traversal using adjacency matrix and recursion.,algorim_a47 | |
| algo_a47_00218,graphs,advanced,breadth_first_search,O(V+E),O(V),"Using Algorim pseudocode syntax, write implement breadth first search (bfs) in algorim.",BFS graph traversal using adjacency matrix and queue.,algorim_a47 | |
| algo_a47_00219,strings,beginner,string_length,O(n),O(1),"Using Algorim pseudocode syntax, write write a string length function in algorim.",Computes string length by counting until null terminator.,algorim_a47 | |
| algo_a47_00220,strings,beginner,palindrome_check,O(n),O(1),"Using Algorim pseudocode syntax, write check if a string is a palindrome in algorim.",Checks if a string is a palindrome using two pointers.,algorim_a47 | |
| algo_a47_00221,strings,beginner,string_reverse,O(n),O(1),"Using Algorim pseudocode syntax, write reverse a string in-place in algorim.",Reverses a string in-place.,algorim_a47 | |
| algo_a47_00222,strings,beginner,string_copy,O(n),O(1),"Using Algorim pseudocode syntax, write copy a string in algorim.",Copies string src to dst.,algorim_a47 | |
| algo_a47_00223,strings,beginner,count_character,O(n),O(1),"Using Algorim pseudocode syntax, write count occurrences of a character in a string in algorim.",Counts occurrences of character c in string s.,algorim_a47 | |
| algo_a47_00224,dynamic_programming,advanced,longest_common_subsequence,O(m*n),O(m*n),"Using Algorim pseudocode syntax, write implement lcs algorithm in algorim.",Finds the length of the Longest Common Subsequence using DP.,algorim_a47 | |
| algo_a47_00225,dynamic_programming,advanced,knapsack_0_1,O(n*W),O(n*W),"Using Algorim pseudocode syntax, write implement the 0/1 knapsack problem in algorim.",0/1 Knapsack problem using bottom-up DP.,algorim_a47 | |
| algo_a47_00226,dynamic_programming,advanced,coin_change,O(amount * n),O(amount),"Using Algorim pseudocode syntax, write implement coin change problem in algorim.",Minimum number of coins to make an amount (DP).,algorim_a47 | |
| algo_a47_00227,number_theory,intermediate,sieve_eratosthenes,O(n log log n),O(n),"Using Algorim pseudocode syntax, write implement the sieve of eratosthenes in algorim.",Sieve of Eratosthenes to find all primes up to n.,algorim_a47 | |
| algo_a47_00228,number_theory,beginner,binary_to_decimal,O(n),O(1),"Using Algorim pseudocode syntax, write convert binary to decimal in algorim.",Converts binary string to decimal integer.,algorim_a47 | |
| algo_a47_00229,data_structures,advanced,hash_table,"O(1) avg, O(n) worst",O(n),"Using Algorim pseudocode syntax, write implement a hash table with chaining in algorim.",Hash table with separate chaining collision resolution.,algorim_a47 | |
| algo_a47_00230,matrix,intermediate,matrix_multiplication,O(n^3),O(1) extra,"Using Algorim pseudocode syntax, write implement matrix multiplication in algorim.","Multiplies two n×n matrices A and B, stores result in C.",algorim_a47 | |
| algo_a47_00231,matrix,beginner,matrix_transpose,O(n^2),O(1),"Using Algorim pseudocode syntax, write transpose a matrix in-place in algorim.",Transposes a square matrix in-place.,algorim_a47 | |
| algo_a47_00232,data_structures,advanced,min_heap,O(log n) insert/extract,O(n),"Using Algorim pseudocode syntax, write implement a min-heap in algorim.",Min-heap with insert and extract_min operations.,algorim_a47 | |
| algo_a47_00233,backtracking,advanced,n_queens,O(n!),O(n^2),"Using Algorim pseudocode syntax, write solve the n-queens problem in algorim.",N-Queens problem using backtracking.,algorim_a47 | |
| algo_a47_00234,commands,beginner,imagine_command,N/A,N/A,"Using Algorim pseudocode syntax, write how do you ask the model to generate an image of an algorithm?",Command to generate a visual image of an algorithm or code.,algorim_a47 | |
| algo_a47_00235,commands,intermediate,compile_command,N/A,N/A,"Using Algorim pseudocode syntax, write how do you compile an algorim function to machine code?",Command to compile Algorim code to executable bytecode.,algorim_a47 | |
| algo_a47_00236,commands,intermediate,debug_command,N/A,N/A,"Using Algorim pseudocode syntax, write how do you debug an algorim function step by step?",Command to debug Algorim code with execution trace.,algorim_a47 | |
| algo_a47_00237,basic,beginner,swap,O(1),O(1),"في لغة Algorim, اكتب خوارزمية write an algorim action to swap two integers.",Exchange values of two integer variables using a temporary variable.,algorim_a47 | |
| algo_a47_00238,math,beginner,absolute_value,O(1),O(1),"في لغة Algorim, اكتب خوارزمية write an algorim function to compute the absolute value.",Returns the absolute value of an integer.,algorim_a47 | |
| algo_a47_00239,math,beginner,power,O(exp),O(1),"في لغة Algorim, اكتب خوارزمية implement a power function in algorim.",Computes base raised to the power of exp using iteration.,algorim_a47 | |
| algo_a47_00240,math,beginner,factorial,O(n),O(1),"في لغة Algorim, اكتب خوارزمية write the factorial function in algorim.",Computes n! iteratively.,algorim_a47 | |
| algo_a47_00241,recursion,intermediate,factorial_recursive,O(n),O(n),"في لغة Algorim, اكتب خوارزمية write a recursive factorial function in algorim.",Recursive factorial computation.,algorim_a47 | |
| algo_a47_00242,math,intermediate,fibonacci,O(n),O(1),"في لغة Algorim, اكتب خوارزمية compute the nth fibonacci number in algorim.",Computes the n-th Fibonacci number iteratively.,algorim_a47 | |
| algo_a47_00243,recursion,intermediate,fibonacci_recursive,O(2^n),O(n),"في لغة Algorim, اكتب خوارزمية write a recursive fibonacci function in algorim.",Recursive Fibonacci using two recursive calls.,algorim_a47 | |
| algo_a47_00244,math,intermediate,gcd,"O(log(min(a,b)))",O(1),"في لغة Algorim, اكتب خوارزمية implement gcd using euclidean algorithm in algorim.",Computes GCD using Euclidean algorithm.,algorim_a47 | |
| algo_a47_00245,math,intermediate,lcm,"O(log(min(a,b)))",O(1),"في لغة Algorim, اكتب خوارزمية write an lcm function in algorim.",Computes LCM using GCD.,algorim_a47 | |
| algo_a47_00246,math,intermediate,primality_test,O(sqrt(n)),O(1),"في لغة Algorim, اكتب خوارزمية write a primality test in algorim.",Checks if a number is prime using trial division up to sqrt(n).,algorim_a47 | |
| algo_a47_00247,arrays,beginner,array_sum,O(n),O(1),"في لغة Algorim, اكتب خوارزمية sum all elements of an array in algorim.",Sums all elements of an integer array.,algorim_a47 | |
| algo_a47_00248,arrays,beginner,find_maximum,O(n),O(1),"في لغة Algorim, اكتب خوارزمية find the maximum element in an array using algorim.",Finds the maximum element in an array.,algorim_a47 | |
| algo_a47_00249,arrays,beginner,find_minimum,O(n),O(1),"في لغة Algorim, اكتب خوارزمية find the minimum element in an array using algorim.",Finds the minimum element in an array.,algorim_a47 | |
| algo_a47_00250,searching,beginner,linear_search,O(n),O(1),"في لغة Algorim, اكتب خوارزمية implement linear search in algorim.","Searches for target in array, returns index or -1.",algorim_a47 | |
| algo_a47_00251,searching,intermediate,binary_search,O(log n),O(1),"في لغة Algorim, اكتب خوارزمية write binary search in algorim for a sorted array.",Binary search on sorted array. Returns index or -1.,algorim_a47 | |
| algo_a47_00252,arrays,beginner,reverse_array,O(n),O(1),"في لغة Algorim, اكتب خوارزمية reverse an array in-place in algorim.",Reverses an array in-place using two pointers.,algorim_a47 | |
| algo_a47_00253,arrays,beginner,count_occurrences,O(n),O(1),"في لغة Algorim, اكتب خوارزمية count occurrences of a value in an array using algorim.",Counts occurrences of val in array T.,algorim_a47 | |
| algo_a47_00254,arrays,beginner,copy_array,O(n),O(1),"في لغة Algorim, اكتب خوارزمية write an array copy function in algorim.",Copies elements from src to dst array.,algorim_a47 | |
| algo_a47_00255,sorting,beginner,bubble_sort,O(n^2),O(1),"في لغة Algorim, اكتب خوارزمية implement bubble sort in algorim.",Bubble sort with early exit optimization.,algorim_a47 | |
| algo_a47_00256,sorting,beginner,selection_sort,O(n^2),O(1),"في لغة Algorim, اكتب خوارزمية implement selection sort in algorim.",Selection sort: finds minimum and places it at front.,algorim_a47 | |
| algo_a47_00257,sorting,intermediate,insertion_sort,O(n^2),O(1),"في لغة Algorim, اكتب خوارزمية implement insertion sort in algorim.",Insertion sort: builds sorted array one element at a time.,algorim_a47 | |
| algo_a47_00258,sorting,advanced,merge_sort,O(n log n),O(n),"في لغة Algorim, اكتب خوارزمية implement merge sort in algorim.",Merge sort: divide-and-conquer stable sorting algorithm.,algorim_a47 | |
| algo_a47_00259,sorting,advanced,quick_sort,"O(n log n) avg, O(n^2) worst",O(log n),"في لغة Algorim, اكتب خوارزمية implement quick sort in algorim.",Quick sort with last element as pivot using Lomuto partition.,algorim_a47 | |
| algo_a47_00260,sorting,advanced,heap_sort,O(n log n),O(1),"في لغة Algorim, اكتب خوارزمية implement heap sort in algorim.",Heap sort using max-heap.,algorim_a47 | |
| algo_a47_00261,linked_list,intermediate,linked_list_basic,"O(1) front, O(n) back",O(1),"في لغة Algorim, اكتب خوارزمية implement singly linked list insert front and back in algorim.",Singly linked list node creation and insertion operations.,algorim_a47 | |
| algo_a47_00262,linked_list,intermediate,linked_list_delete,O(n),O(1),"في لغة Algorim, اكتب خوارزمية delete a node with given value from a singly linked list in algorim.",Delete first occurrence of val from linked list.,algorim_a47 | |
| algo_a47_00263,linked_list,intermediate,reverse_linked_list,O(n),O(1),"في لغة Algorim, اكتب خوارزمية reverse a singly linked list in algorim.",Reverses a singly linked list in-place.,algorim_a47 | |
| algo_a47_00264,linked_list,beginner,list_length,O(n),O(1),"في لغة Algorim, اكتب خوارزمية find the length of a linked list in algorim.",Returns the length of a singly linked list.,algorim_a47 | |
| algo_a47_00265,data_structures,intermediate,stack,O(1) all ops,O(n),"في لغة Algorim, اكتب خوارزمية implement a stack data structure in algorim.","Stack implementation using array with push, pop, peek, isEmpty.",algorim_a47 | |
| algo_a47_00266,data_structures,intermediate,balanced_parentheses,O(n),O(n),"في لغة Algorim, اكتب خوارزمية check if an expression has balanced parentheses in algorim.",Checks if parentheses/brackets/braces are balanced using a stack.,algorim_a47 | |
| algo_a47_00267,data_structures,intermediate,queue,O(1) all ops,O(n),"في لغة Algorim, اكتب خوارزمية implement a circular queue in algorim.","Circular queue implementation with enqueue, dequeue, isEmpty.",algorim_a47 | |
| algo_a47_00268,trees,intermediate,bst_insert,O(h) where h=height,O(h),"في لغة Algorim, اكتب خوارزمية implement bst insertion in algorim.",Inserts a key into a Binary Search Tree.,algorim_a47 | |
| algo_a47_00269,trees,intermediate,bst_search,O(h),O(h),"في لغة Algorim, اكتب خوارزمية search for a key in a bst using algorim.",Searches for a key in a Binary Search Tree.,algorim_a47 | |
| algo_a47_00270,trees,beginner,inorder_traversal,O(n),O(h),"في لغة Algorim, اكتب خوارزمية write in-order traversal of a binary tree in algorim.",In-order traversal of binary tree (Left-Root-Right).,algorim_a47 | |
| algo_a47_00271,trees,beginner,preorder_traversal,O(n),O(h),"في لغة Algorim, اكتب خوارزمية write pre-order traversal of a binary tree in algorim.",Pre-order traversal (Root-Left-Right).,algorim_a47 | |
| algo_a47_00272,trees,beginner,postorder_traversal,O(n),O(h),"في لغة Algorim, اكتب خوارزمية write post-order traversal of a binary tree in algorim.",Post-order traversal (Left-Right-Root).,algorim_a47 | |
| algo_a47_00273,trees,intermediate,tree_height,O(n),O(h),"في لغة Algorim, اكتب خوارزمية find the height of a binary tree in algorim.",Computes the height (depth) of a binary tree.,algorim_a47 | |
| algo_a47_00274,trees,beginner,count_nodes,O(n),O(h),"في لغة Algorim, اكتب خوارزمية count the number of nodes in a binary tree in algorim.",Counts total nodes in a binary tree.,algorim_a47 | |
| algo_a47_00275,trees,intermediate,level_order_traversal,O(n),O(w) w=max width,"في لغة Algorim, اكتب خوارزمية implement level-order (bfs) traversal of a binary tree in algorim.",BFS level-order traversal of binary tree using a queue.,algorim_a47 | |
| algo_a47_00276,graphs,advanced,depth_first_search,O(V+E),O(V),"في لغة Algorim, اكتب خوارزمية implement depth first search (dfs) in algorim.",DFS graph traversal using adjacency matrix and recursion.,algorim_a47 | |
| algo_a47_00277,graphs,advanced,breadth_first_search,O(V+E),O(V),"في لغة Algorim, اكتب خوارزمية implement breadth first search (bfs) in algorim.",BFS graph traversal using adjacency matrix and queue.,algorim_a47 | |
| algo_a47_00278,strings,beginner,string_length,O(n),O(1),"في لغة Algorim, اكتب خوارزمية write a string length function in algorim.",Computes string length by counting until null terminator.,algorim_a47 | |
| algo_a47_00279,strings,beginner,palindrome_check,O(n),O(1),"في لغة Algorim, اكتب خوارزمية check if a string is a palindrome in algorim.",Checks if a string is a palindrome using two pointers.,algorim_a47 | |
| algo_a47_00280,strings,beginner,string_reverse,O(n),O(1),"في لغة Algorim, اكتب خوارزمية reverse a string in-place in algorim.",Reverses a string in-place.,algorim_a47 | |
| algo_a47_00281,strings,beginner,string_copy,O(n),O(1),"في لغة Algorim, اكتب خوارزمية copy a string in algorim.",Copies string src to dst.,algorim_a47 | |
| algo_a47_00282,strings,beginner,count_character,O(n),O(1),"في لغة Algorim, اكتب خوارزمية count occurrences of a character in a string in algorim.",Counts occurrences of character c in string s.,algorim_a47 | |
| algo_a47_00283,dynamic_programming,advanced,longest_common_subsequence,O(m*n),O(m*n),"في لغة Algorim, اكتب خوارزمية implement lcs algorithm in algorim.",Finds the length of the Longest Common Subsequence using DP.,algorim_a47 | |
| algo_a47_00284,dynamic_programming,advanced,knapsack_0_1,O(n*W),O(n*W),"في لغة Algorim, اكتب خوارزمية implement the 0/1 knapsack problem in algorim.",0/1 Knapsack problem using bottom-up DP.,algorim_a47 | |
| algo_a47_00285,dynamic_programming,advanced,coin_change,O(amount * n),O(amount),"في لغة Algorim, اكتب خوارزمية implement coin change problem in algorim.",Minimum number of coins to make an amount (DP).,algorim_a47 | |
| algo_a47_00286,number_theory,intermediate,sieve_eratosthenes,O(n log log n),O(n),"في لغة Algorim, اكتب خوارزمية implement the sieve of eratosthenes in algorim.",Sieve of Eratosthenes to find all primes up to n.,algorim_a47 | |
| algo_a47_00287,number_theory,beginner,binary_to_decimal,O(n),O(1),"في لغة Algorim, اكتب خوارزمية convert binary to decimal in algorim.",Converts binary string to decimal integer.,algorim_a47 | |
| algo_a47_00288,data_structures,advanced,hash_table,"O(1) avg, O(n) worst",O(n),"في لغة Algorim, اكتب خوارزمية implement a hash table with chaining in algorim.",Hash table with separate chaining collision resolution.,algorim_a47 | |
| algo_a47_00289,matrix,intermediate,matrix_multiplication,O(n^3),O(1) extra,"في لغة Algorim, اكتب خوارزمية implement matrix multiplication in algorim.","Multiplies two n×n matrices A and B, stores result in C.",algorim_a47 | |
| algo_a47_00290,matrix,beginner,matrix_transpose,O(n^2),O(1),"في لغة Algorim, اكتب خوارزمية transpose a matrix in-place in algorim.",Transposes a square matrix in-place.,algorim_a47 | |
| algo_a47_00291,data_structures,advanced,min_heap,O(log n) insert/extract,O(n),"في لغة Algorim, اكتب خوارزمية implement a min-heap in algorim.",Min-heap with insert and extract_min operations.,algorim_a47 | |
| algo_a47_00292,backtracking,advanced,n_queens,O(n!),O(n^2),"في لغة Algorim, اكتب خوارزمية solve the n-queens problem in algorim.",N-Queens problem using backtracking.,algorim_a47 | |
| algo_a47_00293,commands,beginner,imagine_command,N/A,N/A,"في لغة Algorim, اكتب خوارزمية how do you ask the model to generate an image of an algorithm?",Command to generate a visual image of an algorithm or code.,algorim_a47 | |
| algo_a47_00294,commands,intermediate,compile_command,N/A,N/A,"في لغة Algorim, اكتب خوارزمية how do you compile an algorim function to machine code?",Command to compile Algorim code to executable bytecode.,algorim_a47 | |
| algo_a47_00295,commands,intermediate,debug_command,N/A,N/A,"في لغة Algorim, اكتب خوارزمية how do you debug an algorim function step by step?",Command to debug Algorim code with execution trace.,algorim_a47 | |
| algo_a47_00296,basic,beginner,swap,O(1),O(1),أكمل الكود التالي في Algorim: write an algorim action to swap two integers.,Exchange values of two integer variables using a temporary variable.,algorim_a47 | |
| algo_a47_00297,math,beginner,absolute_value,O(1),O(1),أكمل الكود التالي في Algorim: write an algorim function to compute the absolute value.,Returns the absolute value of an integer.,algorim_a47 | |
| algo_a47_00298,math,beginner,power,O(exp),O(1),أكمل الكود التالي في Algorim: implement a power function in algorim.,Computes base raised to the power of exp using iteration.,algorim_a47 | |
| algo_a47_00299,math,beginner,factorial,O(n),O(1),أكمل الكود التالي في Algorim: write the factorial function in algorim.,Computes n! iteratively.,algorim_a47 | |
| algo_a47_00300,recursion,intermediate,factorial_recursive,O(n),O(n),أكمل الكود التالي في Algorim: write a recursive factorial function in algorim.,Recursive factorial computation.,algorim_a47 | |
| algo_a47_00301,math,intermediate,fibonacci,O(n),O(1),أكمل الكود التالي في Algorim: compute the nth fibonacci number in algorim.,Computes the n-th Fibonacci number iteratively.,algorim_a47 | |
| algo_a47_00302,recursion,intermediate,fibonacci_recursive,O(2^n),O(n),أكمل الكود التالي في Algorim: write a recursive fibonacci function in algorim.,Recursive Fibonacci using two recursive calls.,algorim_a47 | |
| algo_a47_00303,math,intermediate,gcd,"O(log(min(a,b)))",O(1),أكمل الكود التالي في Algorim: implement gcd using euclidean algorithm in algorim.,Computes GCD using Euclidean algorithm.,algorim_a47 | |
| algo_a47_00304,math,intermediate,lcm,"O(log(min(a,b)))",O(1),أكمل الكود التالي في Algorim: write an lcm function in algorim.,Computes LCM using GCD.,algorim_a47 | |
| algo_a47_00305,math,intermediate,primality_test,O(sqrt(n)),O(1),أكمل الكود التالي في Algorim: write a primality test in algorim.,Checks if a number is prime using trial division up to sqrt(n).,algorim_a47 | |
| algo_a47_00306,arrays,beginner,array_sum,O(n),O(1),أكمل الكود التالي في Algorim: sum all elements of an array in algorim.,Sums all elements of an integer array.,algorim_a47 | |
| algo_a47_00307,arrays,beginner,find_maximum,O(n),O(1),أكمل الكود التالي في Algorim: find the maximum element in an array using algorim.,Finds the maximum element in an array.,algorim_a47 | |
| algo_a47_00308,arrays,beginner,find_minimum,O(n),O(1),أكمل الكود التالي في Algorim: find the minimum element in an array using algorim.,Finds the minimum element in an array.,algorim_a47 | |
| algo_a47_00309,searching,beginner,linear_search,O(n),O(1),أكمل الكود التالي في Algorim: implement linear search in algorim.,"Searches for target in array, returns index or -1.",algorim_a47 | |
| algo_a47_00310,searching,intermediate,binary_search,O(log n),O(1),أكمل الكود التالي في Algorim: write binary search in algorim for a sorted array.,Binary search on sorted array. Returns index or -1.,algorim_a47 | |
| algo_a47_00311,arrays,beginner,reverse_array,O(n),O(1),أكمل الكود التالي في Algorim: reverse an array in-place in algorim.,Reverses an array in-place using two pointers.,algorim_a47 | |
| algo_a47_00312,arrays,beginner,count_occurrences,O(n),O(1),أكمل الكود التالي في Algorim: count occurrences of a value in an array using algorim.,Counts occurrences of val in array T.,algorim_a47 | |
| algo_a47_00313,arrays,beginner,copy_array,O(n),O(1),أكمل الكود التالي في Algorim: write an array copy function in algorim.,Copies elements from src to dst array.,algorim_a47 | |
| algo_a47_00314,sorting,beginner,bubble_sort,O(n^2),O(1),أكمل الكود التالي في Algorim: implement bubble sort in algorim.,Bubble sort with early exit optimization.,algorim_a47 | |
| algo_a47_00315,sorting,beginner,selection_sort,O(n^2),O(1),أكمل الكود التالي في Algorim: implement selection sort in algorim.,Selection sort: finds minimum and places it at front.,algorim_a47 | |
| algo_a47_00316,sorting,intermediate,insertion_sort,O(n^2),O(1),أكمل الكود التالي في Algorim: implement insertion sort in algorim.,Insertion sort: builds sorted array one element at a time.,algorim_a47 | |
| algo_a47_00317,sorting,advanced,merge_sort,O(n log n),O(n),أكمل الكود التالي في Algorim: implement merge sort in algorim.,Merge sort: divide-and-conquer stable sorting algorithm.,algorim_a47 | |
| algo_a47_00318,sorting,advanced,quick_sort,"O(n log n) avg, O(n^2) worst",O(log n),أكمل الكود التالي في Algorim: implement quick sort in algorim.,Quick sort with last element as pivot using Lomuto partition.,algorim_a47 | |
| algo_a47_00319,sorting,advanced,heap_sort,O(n log n),O(1),أكمل الكود التالي في Algorim: implement heap sort in algorim.,Heap sort using max-heap.,algorim_a47 | |
| algo_a47_00320,linked_list,intermediate,linked_list_basic,"O(1) front, O(n) back",O(1),أكمل الكود التالي في Algorim: implement singly linked list insert front and back in algorim.,Singly linked list node creation and insertion operations.,algorim_a47 | |
| algo_a47_00321,linked_list,intermediate,linked_list_delete,O(n),O(1),أكمل الكود التالي في Algorim: delete a node with given value from a singly linked list in algorim.,Delete first occurrence of val from linked list.,algorim_a47 | |
| algo_a47_00322,linked_list,intermediate,reverse_linked_list,O(n),O(1),أكمل الكود التالي في Algorim: reverse a singly linked list in algorim.,Reverses a singly linked list in-place.,algorim_a47 | |
| algo_a47_00323,linked_list,beginner,list_length,O(n),O(1),أكمل الكود التالي في Algorim: find the length of a linked list in algorim.,Returns the length of a singly linked list.,algorim_a47 | |
| algo_a47_00324,data_structures,intermediate,stack,O(1) all ops,O(n),أكمل الكود التالي في Algorim: implement a stack data structure in algorim.,"Stack implementation using array with push, pop, peek, isEmpty.",algorim_a47 | |
| algo_a47_00325,data_structures,intermediate,balanced_parentheses,O(n),O(n),أكمل الكود التالي في Algorim: check if an expression has balanced parentheses in algorim.,Checks if parentheses/brackets/braces are balanced using a stack.,algorim_a47 | |
| algo_a47_00326,data_structures,intermediate,queue,O(1) all ops,O(n),أكمل الكود التالي في Algorim: implement a circular queue in algorim.,"Circular queue implementation with enqueue, dequeue, isEmpty.",algorim_a47 | |
| algo_a47_00327,trees,intermediate,bst_insert,O(h) where h=height,O(h),أكمل الكود التالي في Algorim: implement bst insertion in algorim.,Inserts a key into a Binary Search Tree.,algorim_a47 | |
| algo_a47_00328,trees,intermediate,bst_search,O(h),O(h),أكمل الكود التالي في Algorim: search for a key in a bst using algorim.,Searches for a key in a Binary Search Tree.,algorim_a47 | |
| algo_a47_00329,trees,beginner,inorder_traversal,O(n),O(h),أكمل الكود التالي في Algorim: write in-order traversal of a binary tree in algorim.,In-order traversal of binary tree (Left-Root-Right).,algorim_a47 | |
| algo_a47_00330,trees,beginner,preorder_traversal,O(n),O(h),أكمل الكود التالي في Algorim: write pre-order traversal of a binary tree in algorim.,Pre-order traversal (Root-Left-Right).,algorim_a47 | |
| algo_a47_00331,trees,beginner,postorder_traversal,O(n),O(h),أكمل الكود التالي في Algorim: write post-order traversal of a binary tree in algorim.,Post-order traversal (Left-Right-Root).,algorim_a47 | |
| algo_a47_00332,trees,intermediate,tree_height,O(n),O(h),أكمل الكود التالي في Algorim: find the height of a binary tree in algorim.,Computes the height (depth) of a binary tree.,algorim_a47 | |
| algo_a47_00333,trees,beginner,count_nodes,O(n),O(h),أكمل الكود التالي في Algorim: count the number of nodes in a binary tree in algorim.,Counts total nodes in a binary tree.,algorim_a47 | |
| algo_a47_00334,trees,intermediate,level_order_traversal,O(n),O(w) w=max width,أكمل الكود التالي في Algorim: implement level-order (bfs) traversal of a binary tree in algorim.,BFS level-order traversal of binary tree using a queue.,algorim_a47 | |
| algo_a47_00335,graphs,advanced,depth_first_search,O(V+E),O(V),أكمل الكود التالي في Algorim: implement depth first search (dfs) in algorim.,DFS graph traversal using adjacency matrix and recursion.,algorim_a47 | |
| algo_a47_00336,graphs,advanced,breadth_first_search,O(V+E),O(V),أكمل الكود التالي في Algorim: implement breadth first search (bfs) in algorim.,BFS graph traversal using adjacency matrix and queue.,algorim_a47 | |
| algo_a47_00337,strings,beginner,string_length,O(n),O(1),أكمل الكود التالي في Algorim: write a string length function in algorim.,Computes string length by counting until null terminator.,algorim_a47 | |
| algo_a47_00338,strings,beginner,palindrome_check,O(n),O(1),أكمل الكود التالي في Algorim: check if a string is a palindrome in algorim.,Checks if a string is a palindrome using two pointers.,algorim_a47 | |
| algo_a47_00339,strings,beginner,string_reverse,O(n),O(1),أكمل الكود التالي في Algorim: reverse a string in-place in algorim.,Reverses a string in-place.,algorim_a47 | |
| algo_a47_00340,strings,beginner,string_copy,O(n),O(1),أكمل الكود التالي في Algorim: copy a string in algorim.,Copies string src to dst.,algorim_a47 | |
| algo_a47_00341,strings,beginner,count_character,O(n),O(1),أكمل الكود التالي في Algorim: count occurrences of a character in a string in algorim.,Counts occurrences of character c in string s.,algorim_a47 | |
| algo_a47_00342,dynamic_programming,advanced,longest_common_subsequence,O(m*n),O(m*n),أكمل الكود التالي في Algorim: implement lcs algorithm in algorim.,Finds the length of the Longest Common Subsequence using DP.,algorim_a47 | |
| algo_a47_00343,dynamic_programming,advanced,knapsack_0_1,O(n*W),O(n*W),أكمل الكود التالي في Algorim: implement the 0/1 knapsack problem in algorim.,0/1 Knapsack problem using bottom-up DP.,algorim_a47 | |
| algo_a47_00344,dynamic_programming,advanced,coin_change,O(amount * n),O(amount),أكمل الكود التالي في Algorim: implement coin change problem in algorim.,Minimum number of coins to make an amount (DP).,algorim_a47 | |
| algo_a47_00345,number_theory,intermediate,sieve_eratosthenes,O(n log log n),O(n),أكمل الكود التالي في Algorim: implement the sieve of eratosthenes in algorim.,Sieve of Eratosthenes to find all primes up to n.,algorim_a47 | |
| algo_a47_00346,number_theory,beginner,binary_to_decimal,O(n),O(1),أكمل الكود التالي في Algorim: convert binary to decimal in algorim.,Converts binary string to decimal integer.,algorim_a47 | |
| algo_a47_00347,data_structures,advanced,hash_table,"O(1) avg, O(n) worst",O(n),أكمل الكود التالي في Algorim: implement a hash table with chaining in algorim.,Hash table with separate chaining collision resolution.,algorim_a47 | |
| algo_a47_00348,matrix,intermediate,matrix_multiplication,O(n^3),O(1) extra,أكمل الكود التالي في Algorim: implement matrix multiplication in algorim.,"Multiplies two n×n matrices A and B, stores result in C.",algorim_a47 | |
| algo_a47_00349,matrix,beginner,matrix_transpose,O(n^2),O(1),أكمل الكود التالي في Algorim: transpose a matrix in-place in algorim.,Transposes a square matrix in-place.,algorim_a47 | |
| algo_a47_00350,data_structures,advanced,min_heap,O(log n) insert/extract,O(n),أكمل الكود التالي في Algorim: implement a min-heap in algorim.,Min-heap with insert and extract_min operations.,algorim_a47 | |
| algo_a47_00351,backtracking,advanced,n_queens,O(n!),O(n^2),أكمل الكود التالي في Algorim: solve the n-queens problem in algorim.,N-Queens problem using backtracking.,algorim_a47 | |
| algo_a47_00352,commands,beginner,imagine_command,N/A,N/A,أكمل الكود التالي في Algorim: how do you ask the model to generate an image of an algorithm?,Command to generate a visual image of an algorithm or code.,algorim_a47 | |
| algo_a47_00353,commands,intermediate,compile_command,N/A,N/A,أكمل الكود التالي في Algorim: how do you compile an algorim function to machine code?,Command to compile Algorim code to executable bytecode.,algorim_a47 | |
| algo_a47_00354,commands,intermediate,debug_command,N/A,N/A,أكمل الكود التالي في Algorim: how do you debug an algorim function step by step?,Command to debug Algorim code with execution trace.,algorim_a47 | |
| algo_a47_00355,basic,beginner,swap,O(1),O(1),Explain and write in Algorim: write an algorim action to swap two integers.,Exchange values of two integer variables using a temporary variable.,algorim_a47 | |
| algo_a47_00356,math,beginner,absolute_value,O(1),O(1),Explain and write in Algorim: write an algorim function to compute the absolute value.,Returns the absolute value of an integer.,algorim_a47 | |
| algo_a47_00357,math,beginner,power,O(exp),O(1),Explain and write in Algorim: implement a power function in algorim.,Computes base raised to the power of exp using iteration.,algorim_a47 | |
| algo_a47_00358,math,beginner,factorial,O(n),O(1),Explain and write in Algorim: write the factorial function in algorim.,Computes n! iteratively.,algorim_a47 | |
| algo_a47_00359,recursion,intermediate,factorial_recursive,O(n),O(n),Explain and write in Algorim: write a recursive factorial function in algorim.,Recursive factorial computation.,algorim_a47 | |
| algo_a47_00360,math,intermediate,fibonacci,O(n),O(1),Explain and write in Algorim: compute the nth fibonacci number in algorim.,Computes the n-th Fibonacci number iteratively.,algorim_a47 | |
| algo_a47_00361,recursion,intermediate,fibonacci_recursive,O(2^n),O(n),Explain and write in Algorim: write a recursive fibonacci function in algorim.,Recursive Fibonacci using two recursive calls.,algorim_a47 | |
| algo_a47_00362,math,intermediate,gcd,"O(log(min(a,b)))",O(1),Explain and write in Algorim: implement gcd using euclidean algorithm in algorim.,Computes GCD using Euclidean algorithm.,algorim_a47 | |
| algo_a47_00363,math,intermediate,lcm,"O(log(min(a,b)))",O(1),Explain and write in Algorim: write an lcm function in algorim.,Computes LCM using GCD.,algorim_a47 | |
| algo_a47_00364,math,intermediate,primality_test,O(sqrt(n)),O(1),Explain and write in Algorim: write a primality test in algorim.,Checks if a number is prime using trial division up to sqrt(n).,algorim_a47 | |
| algo_a47_00365,arrays,beginner,array_sum,O(n),O(1),Explain and write in Algorim: sum all elements of an array in algorim.,Sums all elements of an integer array.,algorim_a47 | |
| algo_a47_00366,arrays,beginner,find_maximum,O(n),O(1),Explain and write in Algorim: find the maximum element in an array using algorim.,Finds the maximum element in an array.,algorim_a47 | |
| algo_a47_00367,arrays,beginner,find_minimum,O(n),O(1),Explain and write in Algorim: find the minimum element in an array using algorim.,Finds the minimum element in an array.,algorim_a47 | |
| algo_a47_00368,searching,beginner,linear_search,O(n),O(1),Explain and write in Algorim: implement linear search in algorim.,"Searches for target in array, returns index or -1.",algorim_a47 | |
| algo_a47_00369,searching,intermediate,binary_search,O(log n),O(1),Explain and write in Algorim: write binary search in algorim for a sorted array.,Binary search on sorted array. Returns index or -1.,algorim_a47 | |
| algo_a47_00370,arrays,beginner,reverse_array,O(n),O(1),Explain and write in Algorim: reverse an array in-place in algorim.,Reverses an array in-place using two pointers.,algorim_a47 | |
| algo_a47_00371,arrays,beginner,count_occurrences,O(n),O(1),Explain and write in Algorim: count occurrences of a value in an array using algorim.,Counts occurrences of val in array T.,algorim_a47 | |
| algo_a47_00372,arrays,beginner,copy_array,O(n),O(1),Explain and write in Algorim: write an array copy function in algorim.,Copies elements from src to dst array.,algorim_a47 | |
| algo_a47_00373,sorting,beginner,bubble_sort,O(n^2),O(1),Explain and write in Algorim: implement bubble sort in algorim.,Bubble sort with early exit optimization.,algorim_a47 | |
| algo_a47_00374,sorting,beginner,selection_sort,O(n^2),O(1),Explain and write in Algorim: implement selection sort in algorim.,Selection sort: finds minimum and places it at front.,algorim_a47 | |
| algo_a47_00375,sorting,intermediate,insertion_sort,O(n^2),O(1),Explain and write in Algorim: implement insertion sort in algorim.,Insertion sort: builds sorted array one element at a time.,algorim_a47 | |
| algo_a47_00376,sorting,advanced,merge_sort,O(n log n),O(n),Explain and write in Algorim: implement merge sort in algorim.,Merge sort: divide-and-conquer stable sorting algorithm.,algorim_a47 | |
| algo_a47_00377,sorting,advanced,quick_sort,"O(n log n) avg, O(n^2) worst",O(log n),Explain and write in Algorim: implement quick sort in algorim.,Quick sort with last element as pivot using Lomuto partition.,algorim_a47 | |
| algo_a47_00378,sorting,advanced,heap_sort,O(n log n),O(1),Explain and write in Algorim: implement heap sort in algorim.,Heap sort using max-heap.,algorim_a47 | |
| algo_a47_00379,linked_list,intermediate,linked_list_basic,"O(1) front, O(n) back",O(1),Explain and write in Algorim: implement singly linked list insert front and back in algorim.,Singly linked list node creation and insertion operations.,algorim_a47 | |
| algo_a47_00380,linked_list,intermediate,linked_list_delete,O(n),O(1),Explain and write in Algorim: delete a node with given value from a singly linked list in algorim.,Delete first occurrence of val from linked list.,algorim_a47 | |
| algo_a47_00381,linked_list,intermediate,reverse_linked_list,O(n),O(1),Explain and write in Algorim: reverse a singly linked list in algorim.,Reverses a singly linked list in-place.,algorim_a47 | |
| algo_a47_00382,linked_list,beginner,list_length,O(n),O(1),Explain and write in Algorim: find the length of a linked list in algorim.,Returns the length of a singly linked list.,algorim_a47 | |
| algo_a47_00383,data_structures,intermediate,stack,O(1) all ops,O(n),Explain and write in Algorim: implement a stack data structure in algorim.,"Stack implementation using array with push, pop, peek, isEmpty.",algorim_a47 | |
| algo_a47_00384,data_structures,intermediate,balanced_parentheses,O(n),O(n),Explain and write in Algorim: check if an expression has balanced parentheses in algorim.,Checks if parentheses/brackets/braces are balanced using a stack.,algorim_a47 | |
| algo_a47_00385,data_structures,intermediate,queue,O(1) all ops,O(n),Explain and write in Algorim: implement a circular queue in algorim.,"Circular queue implementation with enqueue, dequeue, isEmpty.",algorim_a47 | |
| algo_a47_00386,trees,intermediate,bst_insert,O(h) where h=height,O(h),Explain and write in Algorim: implement bst insertion in algorim.,Inserts a key into a Binary Search Tree.,algorim_a47 | |
| algo_a47_00387,trees,intermediate,bst_search,O(h),O(h),Explain and write in Algorim: search for a key in a bst using algorim.,Searches for a key in a Binary Search Tree.,algorim_a47 | |
| algo_a47_00388,trees,beginner,inorder_traversal,O(n),O(h),Explain and write in Algorim: write in-order traversal of a binary tree in algorim.,In-order traversal of binary tree (Left-Root-Right).,algorim_a47 | |
| algo_a47_00389,trees,beginner,preorder_traversal,O(n),O(h),Explain and write in Algorim: write pre-order traversal of a binary tree in algorim.,Pre-order traversal (Root-Left-Right).,algorim_a47 | |
| algo_a47_00390,trees,beginner,postorder_traversal,O(n),O(h),Explain and write in Algorim: write post-order traversal of a binary tree in algorim.,Post-order traversal (Left-Right-Root).,algorim_a47 | |
| algo_a47_00391,trees,intermediate,tree_height,O(n),O(h),Explain and write in Algorim: find the height of a binary tree in algorim.,Computes the height (depth) of a binary tree.,algorim_a47 | |
| algo_a47_00392,trees,beginner,count_nodes,O(n),O(h),Explain and write in Algorim: count the number of nodes in a binary tree in algorim.,Counts total nodes in a binary tree.,algorim_a47 | |
| algo_a47_00393,trees,intermediate,level_order_traversal,O(n),O(w) w=max width,Explain and write in Algorim: implement level-order (bfs) traversal of a binary tree in algorim.,BFS level-order traversal of binary tree using a queue.,algorim_a47 | |
| algo_a47_00394,graphs,advanced,depth_first_search,O(V+E),O(V),Explain and write in Algorim: implement depth first search (dfs) in algorim.,DFS graph traversal using adjacency matrix and recursion.,algorim_a47 | |
| algo_a47_00395,graphs,advanced,breadth_first_search,O(V+E),O(V),Explain and write in Algorim: implement breadth first search (bfs) in algorim.,BFS graph traversal using adjacency matrix and queue.,algorim_a47 | |
| algo_a47_00396,strings,beginner,string_length,O(n),O(1),Explain and write in Algorim: write a string length function in algorim.,Computes string length by counting until null terminator.,algorim_a47 | |
| algo_a47_00397,strings,beginner,palindrome_check,O(n),O(1),Explain and write in Algorim: check if a string is a palindrome in algorim.,Checks if a string is a palindrome using two pointers.,algorim_a47 | |
| algo_a47_00398,strings,beginner,string_reverse,O(n),O(1),Explain and write in Algorim: reverse a string in-place in algorim.,Reverses a string in-place.,algorim_a47 | |
| algo_a47_00399,strings,beginner,string_copy,O(n),O(1),Explain and write in Algorim: copy a string in algorim.,Copies string src to dst.,algorim_a47 | |
| algo_a47_00400,strings,beginner,count_character,O(n),O(1),Explain and write in Algorim: count occurrences of a character in a string in algorim.,Counts occurrences of character c in string s.,algorim_a47 | |
| algo_a47_00401,dynamic_programming,advanced,longest_common_subsequence,O(m*n),O(m*n),Explain and write in Algorim: implement lcs algorithm in algorim.,Finds the length of the Longest Common Subsequence using DP.,algorim_a47 | |
| algo_a47_00402,dynamic_programming,advanced,knapsack_0_1,O(n*W),O(n*W),Explain and write in Algorim: implement the 0/1 knapsack problem in algorim.,0/1 Knapsack problem using bottom-up DP.,algorim_a47 | |
| algo_a47_00403,dynamic_programming,advanced,coin_change,O(amount * n),O(amount),Explain and write in Algorim: implement coin change problem in algorim.,Minimum number of coins to make an amount (DP).,algorim_a47 | |
| algo_a47_00404,number_theory,intermediate,sieve_eratosthenes,O(n log log n),O(n),Explain and write in Algorim: implement the sieve of eratosthenes in algorim.,Sieve of Eratosthenes to find all primes up to n.,algorim_a47 | |
| algo_a47_00405,number_theory,beginner,binary_to_decimal,O(n),O(1),Explain and write in Algorim: convert binary to decimal in algorim.,Converts binary string to decimal integer.,algorim_a47 | |
| algo_a47_00406,data_structures,advanced,hash_table,"O(1) avg, O(n) worst",O(n),Explain and write in Algorim: implement a hash table with chaining in algorim.,Hash table with separate chaining collision resolution.,algorim_a47 | |
| algo_a47_00407,matrix,intermediate,matrix_multiplication,O(n^3),O(1) extra,Explain and write in Algorim: implement matrix multiplication in algorim.,"Multiplies two n×n matrices A and B, stores result in C.",algorim_a47 | |
| algo_a47_00408,matrix,beginner,matrix_transpose,O(n^2),O(1),Explain and write in Algorim: transpose a matrix in-place in algorim.,Transposes a square matrix in-place.,algorim_a47 | |
| algo_a47_00409,data_structures,advanced,min_heap,O(log n) insert/extract,O(n),Explain and write in Algorim: implement a min-heap in algorim.,Min-heap with insert and extract_min operations.,algorim_a47 | |
| algo_a47_00410,backtracking,advanced,n_queens,O(n!),O(n^2),Explain and write in Algorim: solve the n-queens problem in algorim.,N-Queens problem using backtracking.,algorim_a47 | |
| algo_a47_00411,commands,beginner,imagine_command,N/A,N/A,Explain and write in Algorim: how do you ask the model to generate an image of an algorithm?,Command to generate a visual image of an algorithm or code.,algorim_a47 | |
| algo_a47_00412,commands,intermediate,compile_command,N/A,N/A,Explain and write in Algorim: how do you compile an algorim function to machine code?,Command to compile Algorim code to executable bytecode.,algorim_a47 | |
| algo_a47_00413,commands,intermediate,debug_command,N/A,N/A,Explain and write in Algorim: how do you debug an algorim function step by step?,Command to debug Algorim code with execution trace.,algorim_a47 | |
| algo_a47_00414,basic,beginner,swap,O(1),O(1),Show the Algorim implementation of write an algorim action to swap two integers.,Exchange values of two integer variables using a temporary variable.,algorim_a47 | |
| algo_a47_00415,math,beginner,absolute_value,O(1),O(1),Show the Algorim implementation of write an algorim function to compute the absolute value.,Returns the absolute value of an integer.,algorim_a47 | |
| algo_a47_00416,math,beginner,power,O(exp),O(1),Show the Algorim implementation of implement a power function in algorim.,Computes base raised to the power of exp using iteration.,algorim_a47 | |
| algo_a47_00417,math,beginner,factorial,O(n),O(1),Show the Algorim implementation of write the factorial function in algorim.,Computes n! iteratively.,algorim_a47 | |
| algo_a47_00418,recursion,intermediate,factorial_recursive,O(n),O(n),Show the Algorim implementation of write a recursive factorial function in algorim.,Recursive factorial computation.,algorim_a47 | |
| algo_a47_00419,math,intermediate,fibonacci,O(n),O(1),Show the Algorim implementation of compute the nth fibonacci number in algorim.,Computes the n-th Fibonacci number iteratively.,algorim_a47 | |
| algo_a47_00420,recursion,intermediate,fibonacci_recursive,O(2^n),O(n),Show the Algorim implementation of write a recursive fibonacci function in algorim.,Recursive Fibonacci using two recursive calls.,algorim_a47 | |
| algo_a47_00421,math,intermediate,gcd,"O(log(min(a,b)))",O(1),Show the Algorim implementation of implement gcd using euclidean algorithm in algorim.,Computes GCD using Euclidean algorithm.,algorim_a47 | |
| algo_a47_00422,math,intermediate,lcm,"O(log(min(a,b)))",O(1),Show the Algorim implementation of write an lcm function in algorim.,Computes LCM using GCD.,algorim_a47 | |
| algo_a47_00423,math,intermediate,primality_test,O(sqrt(n)),O(1),Show the Algorim implementation of write a primality test in algorim.,Checks if a number is prime using trial division up to sqrt(n).,algorim_a47 | |
| algo_a47_00424,arrays,beginner,array_sum,O(n),O(1),Show the Algorim implementation of sum all elements of an array in algorim.,Sums all elements of an integer array.,algorim_a47 | |
| algo_a47_00425,arrays,beginner,find_maximum,O(n),O(1),Show the Algorim implementation of find the maximum element in an array using algorim.,Finds the maximum element in an array.,algorim_a47 | |
| algo_a47_00426,arrays,beginner,find_minimum,O(n),O(1),Show the Algorim implementation of find the minimum element in an array using algorim.,Finds the minimum element in an array.,algorim_a47 | |
| algo_a47_00427,searching,beginner,linear_search,O(n),O(1),Show the Algorim implementation of implement linear search in algorim.,"Searches for target in array, returns index or -1.",algorim_a47 | |
| algo_a47_00428,searching,intermediate,binary_search,O(log n),O(1),Show the Algorim implementation of write binary search in algorim for a sorted array.,Binary search on sorted array. Returns index or -1.,algorim_a47 | |
| algo_a47_00429,arrays,beginner,reverse_array,O(n),O(1),Show the Algorim implementation of reverse an array in-place in algorim.,Reverses an array in-place using two pointers.,algorim_a47 | |
| algo_a47_00430,arrays,beginner,count_occurrences,O(n),O(1),Show the Algorim implementation of count occurrences of a value in an array using algorim.,Counts occurrences of val in array T.,algorim_a47 | |
| algo_a47_00431,arrays,beginner,copy_array,O(n),O(1),Show the Algorim implementation of write an array copy function in algorim.,Copies elements from src to dst array.,algorim_a47 | |
| algo_a47_00432,sorting,beginner,bubble_sort,O(n^2),O(1),Show the Algorim implementation of implement bubble sort in algorim.,Bubble sort with early exit optimization.,algorim_a47 | |
| algo_a47_00433,sorting,beginner,selection_sort,O(n^2),O(1),Show the Algorim implementation of implement selection sort in algorim.,Selection sort: finds minimum and places it at front.,algorim_a47 | |
| algo_a47_00434,sorting,intermediate,insertion_sort,O(n^2),O(1),Show the Algorim implementation of implement insertion sort in algorim.,Insertion sort: builds sorted array one element at a time.,algorim_a47 | |
| algo_a47_00435,sorting,advanced,merge_sort,O(n log n),O(n),Show the Algorim implementation of implement merge sort in algorim.,Merge sort: divide-and-conquer stable sorting algorithm.,algorim_a47 | |
| algo_a47_00436,sorting,advanced,quick_sort,"O(n log n) avg, O(n^2) worst",O(log n),Show the Algorim implementation of implement quick sort in algorim.,Quick sort with last element as pivot using Lomuto partition.,algorim_a47 | |
| algo_a47_00437,sorting,advanced,heap_sort,O(n log n),O(1),Show the Algorim implementation of implement heap sort in algorim.,Heap sort using max-heap.,algorim_a47 | |
| algo_a47_00438,linked_list,intermediate,linked_list_basic,"O(1) front, O(n) back",O(1),Show the Algorim implementation of implement singly linked list insert front and back in algorim.,Singly linked list node creation and insertion operations.,algorim_a47 | |
| algo_a47_00439,linked_list,intermediate,linked_list_delete,O(n),O(1),Show the Algorim implementation of delete a node with given value from a singly linked list in algorim.,Delete first occurrence of val from linked list.,algorim_a47 | |
| algo_a47_00440,linked_list,intermediate,reverse_linked_list,O(n),O(1),Show the Algorim implementation of reverse a singly linked list in algorim.,Reverses a singly linked list in-place.,algorim_a47 | |
| algo_a47_00441,linked_list,beginner,list_length,O(n),O(1),Show the Algorim implementation of find the length of a linked list in algorim.,Returns the length of a singly linked list.,algorim_a47 | |
| algo_a47_00442,data_structures,intermediate,stack,O(1) all ops,O(n),Show the Algorim implementation of implement a stack data structure in algorim.,"Stack implementation using array with push, pop, peek, isEmpty.",algorim_a47 | |
| algo_a47_00443,data_structures,intermediate,balanced_parentheses,O(n),O(n),Show the Algorim implementation of check if an expression has balanced parentheses in algorim.,Checks if parentheses/brackets/braces are balanced using a stack.,algorim_a47 | |
| algo_a47_00444,data_structures,intermediate,queue,O(1) all ops,O(n),Show the Algorim implementation of implement a circular queue in algorim.,"Circular queue implementation with enqueue, dequeue, isEmpty.",algorim_a47 | |
| algo_a47_00445,trees,intermediate,bst_insert,O(h) where h=height,O(h),Show the Algorim implementation of implement bst insertion in algorim.,Inserts a key into a Binary Search Tree.,algorim_a47 | |
| algo_a47_00446,trees,intermediate,bst_search,O(h),O(h),Show the Algorim implementation of search for a key in a bst using algorim.,Searches for a key in a Binary Search Tree.,algorim_a47 | |
| algo_a47_00447,trees,beginner,inorder_traversal,O(n),O(h),Show the Algorim implementation of write in-order traversal of a binary tree in algorim.,In-order traversal of binary tree (Left-Root-Right).,algorim_a47 | |
| algo_a47_00448,trees,beginner,preorder_traversal,O(n),O(h),Show the Algorim implementation of write pre-order traversal of a binary tree in algorim.,Pre-order traversal (Root-Left-Right).,algorim_a47 | |
| algo_a47_00449,trees,beginner,postorder_traversal,O(n),O(h),Show the Algorim implementation of write post-order traversal of a binary tree in algorim.,Post-order traversal (Left-Right-Root).,algorim_a47 | |
| algo_a47_00450,trees,intermediate,tree_height,O(n),O(h),Show the Algorim implementation of find the height of a binary tree in algorim.,Computes the height (depth) of a binary tree.,algorim_a47 | |
| algo_a47_00451,trees,beginner,count_nodes,O(n),O(h),Show the Algorim implementation of count the number of nodes in a binary tree in algorim.,Counts total nodes in a binary tree.,algorim_a47 | |
| algo_a47_00452,trees,intermediate,level_order_traversal,O(n),O(w) w=max width,Show the Algorim implementation of implement level-order (bfs) traversal of a binary tree in algorim.,BFS level-order traversal of binary tree using a queue.,algorim_a47 | |
| algo_a47_00453,graphs,advanced,depth_first_search,O(V+E),O(V),Show the Algorim implementation of implement depth first search (dfs) in algorim.,DFS graph traversal using adjacency matrix and recursion.,algorim_a47 | |
| algo_a47_00454,graphs,advanced,breadth_first_search,O(V+E),O(V),Show the Algorim implementation of implement breadth first search (bfs) in algorim.,BFS graph traversal using adjacency matrix and queue.,algorim_a47 | |
| algo_a47_00455,strings,beginner,string_length,O(n),O(1),Show the Algorim implementation of write a string length function in algorim.,Computes string length by counting until null terminator.,algorim_a47 | |
| algo_a47_00456,strings,beginner,palindrome_check,O(n),O(1),Show the Algorim implementation of check if a string is a palindrome in algorim.,Checks if a string is a palindrome using two pointers.,algorim_a47 | |
| algo_a47_00457,strings,beginner,string_reverse,O(n),O(1),Show the Algorim implementation of reverse a string in-place in algorim.,Reverses a string in-place.,algorim_a47 | |
| algo_a47_00458,strings,beginner,string_copy,O(n),O(1),Show the Algorim implementation of copy a string in algorim.,Copies string src to dst.,algorim_a47 | |
| algo_a47_00459,strings,beginner,count_character,O(n),O(1),Show the Algorim implementation of count occurrences of a character in a string in algorim.,Counts occurrences of character c in string s.,algorim_a47 | |
| algo_a47_00460,dynamic_programming,advanced,longest_common_subsequence,O(m*n),O(m*n),Show the Algorim implementation of implement lcs algorithm in algorim.,Finds the length of the Longest Common Subsequence using DP.,algorim_a47 | |
| algo_a47_00461,dynamic_programming,advanced,knapsack_0_1,O(n*W),O(n*W),Show the Algorim implementation of implement the 0/1 knapsack problem in algorim.,0/1 Knapsack problem using bottom-up DP.,algorim_a47 | |
| algo_a47_00462,dynamic_programming,advanced,coin_change,O(amount * n),O(amount),Show the Algorim implementation of implement coin change problem in algorim.,Minimum number of coins to make an amount (DP).,algorim_a47 | |
| algo_a47_00463,number_theory,intermediate,sieve_eratosthenes,O(n log log n),O(n),Show the Algorim implementation of implement the sieve of eratosthenes in algorim.,Sieve of Eratosthenes to find all primes up to n.,algorim_a47 | |
| algo_a47_00464,number_theory,beginner,binary_to_decimal,O(n),O(1),Show the Algorim implementation of convert binary to decimal in algorim.,Converts binary string to decimal integer.,algorim_a47 | |
| algo_a47_00465,data_structures,advanced,hash_table,"O(1) avg, O(n) worst",O(n),Show the Algorim implementation of implement a hash table with chaining in algorim.,Hash table with separate chaining collision resolution.,algorim_a47 | |
| algo_a47_00466,matrix,intermediate,matrix_multiplication,O(n^3),O(1) extra,Show the Algorim implementation of implement matrix multiplication in algorim.,"Multiplies two n×n matrices A and B, stores result in C.",algorim_a47 | |
| algo_a47_00467,matrix,beginner,matrix_transpose,O(n^2),O(1),Show the Algorim implementation of transpose a matrix in-place in algorim.,Transposes a square matrix in-place.,algorim_a47 | |
| algo_a47_00468,data_structures,advanced,min_heap,O(log n) insert/extract,O(n),Show the Algorim implementation of implement a min-heap in algorim.,Min-heap with insert and extract_min operations.,algorim_a47 | |
| algo_a47_00469,backtracking,advanced,n_queens,O(n!),O(n^2),Show the Algorim implementation of solve the n-queens problem in algorim.,N-Queens problem using backtracking.,algorim_a47 | |
| algo_a47_00470,commands,beginner,imagine_command,N/A,N/A,Show the Algorim implementation of how do you ask the model to generate an image of an algorithm?,Command to generate a visual image of an algorithm or code.,algorim_a47 | |
| algo_a47_00471,commands,intermediate,compile_command,N/A,N/A,Show the Algorim implementation of how do you compile an algorim function to machine code?,Command to compile Algorim code to executable bytecode.,algorim_a47 | |
| algo_a47_00472,commands,intermediate,debug_command,N/A,N/A,Show the Algorim implementation of how do you debug an algorim function step by step?,Command to debug Algorim code with execution trace.,algorim_a47 | |
| algo_a47_00473,basic,beginner,swap,O(1),O(1),Debug and write correct Algorim code for write an algorim action to swap two integers.,Exchange values of two integer variables using a temporary variable.,algorim_a47 | |
| algo_a47_00474,math,beginner,absolute_value,O(1),O(1),Debug and write correct Algorim code for write an algorim function to compute the absolute value.,Returns the absolute value of an integer.,algorim_a47 | |
| algo_a47_00475,math,beginner,power,O(exp),O(1),Debug and write correct Algorim code for implement a power function in algorim.,Computes base raised to the power of exp using iteration.,algorim_a47 | |
| algo_a47_00476,math,beginner,factorial,O(n),O(1),Debug and write correct Algorim code for write the factorial function in algorim.,Computes n! iteratively.,algorim_a47 | |
| algo_a47_00477,recursion,intermediate,factorial_recursive,O(n),O(n),Debug and write correct Algorim code for write a recursive factorial function in algorim.,Recursive factorial computation.,algorim_a47 | |
| algo_a47_00478,math,intermediate,fibonacci,O(n),O(1),Debug and write correct Algorim code for compute the nth fibonacci number in algorim.,Computes the n-th Fibonacci number iteratively.,algorim_a47 | |
| algo_a47_00479,recursion,intermediate,fibonacci_recursive,O(2^n),O(n),Debug and write correct Algorim code for write a recursive fibonacci function in algorim.,Recursive Fibonacci using two recursive calls.,algorim_a47 | |
| algo_a47_00480,math,intermediate,gcd,"O(log(min(a,b)))",O(1),Debug and write correct Algorim code for implement gcd using euclidean algorithm in algorim.,Computes GCD using Euclidean algorithm.,algorim_a47 | |
| algo_a47_00481,math,intermediate,lcm,"O(log(min(a,b)))",O(1),Debug and write correct Algorim code for write an lcm function in algorim.,Computes LCM using GCD.,algorim_a47 | |
| algo_a47_00482,math,intermediate,primality_test,O(sqrt(n)),O(1),Debug and write correct Algorim code for write a primality test in algorim.,Checks if a number is prime using trial division up to sqrt(n).,algorim_a47 | |
| algo_a47_00483,arrays,beginner,array_sum,O(n),O(1),Debug and write correct Algorim code for sum all elements of an array in algorim.,Sums all elements of an integer array.,algorim_a47 | |
| algo_a47_00484,arrays,beginner,find_maximum,O(n),O(1),Debug and write correct Algorim code for find the maximum element in an array using algorim.,Finds the maximum element in an array.,algorim_a47 | |
| algo_a47_00485,arrays,beginner,find_minimum,O(n),O(1),Debug and write correct Algorim code for find the minimum element in an array using algorim.,Finds the minimum element in an array.,algorim_a47 | |
| algo_a47_00486,searching,beginner,linear_search,O(n),O(1),Debug and write correct Algorim code for implement linear search in algorim.,"Searches for target in array, returns index or -1.",algorim_a47 | |
| algo_a47_00487,searching,intermediate,binary_search,O(log n),O(1),Debug and write correct Algorim code for write binary search in algorim for a sorted array.,Binary search on sorted array. Returns index or -1.,algorim_a47 | |
| algo_a47_00488,arrays,beginner,reverse_array,O(n),O(1),Debug and write correct Algorim code for reverse an array in-place in algorim.,Reverses an array in-place using two pointers.,algorim_a47 | |
| algo_a47_00489,arrays,beginner,count_occurrences,O(n),O(1),Debug and write correct Algorim code for count occurrences of a value in an array using algorim.,Counts occurrences of val in array T.,algorim_a47 | |
| algo_a47_00490,arrays,beginner,copy_array,O(n),O(1),Debug and write correct Algorim code for write an array copy function in algorim.,Copies elements from src to dst array.,algorim_a47 | |
| algo_a47_00491,sorting,beginner,bubble_sort,O(n^2),O(1),Debug and write correct Algorim code for implement bubble sort in algorim.,Bubble sort with early exit optimization.,algorim_a47 | |
| algo_a47_00492,sorting,beginner,selection_sort,O(n^2),O(1),Debug and write correct Algorim code for implement selection sort in algorim.,Selection sort: finds minimum and places it at front.,algorim_a47 | |
| algo_a47_00493,sorting,intermediate,insertion_sort,O(n^2),O(1),Debug and write correct Algorim code for implement insertion sort in algorim.,Insertion sort: builds sorted array one element at a time.,algorim_a47 | |
| algo_a47_00494,sorting,advanced,merge_sort,O(n log n),O(n),Debug and write correct Algorim code for implement merge sort in algorim.,Merge sort: divide-and-conquer stable sorting algorithm.,algorim_a47 | |
| algo_a47_00495,sorting,advanced,quick_sort,"O(n log n) avg, O(n^2) worst",O(log n),Debug and write correct Algorim code for implement quick sort in algorim.,Quick sort with last element as pivot using Lomuto partition.,algorim_a47 | |
| algo_a47_00496,sorting,advanced,heap_sort,O(n log n),O(1),Debug and write correct Algorim code for implement heap sort in algorim.,Heap sort using max-heap.,algorim_a47 | |
| algo_a47_00497,linked_list,intermediate,linked_list_basic,"O(1) front, O(n) back",O(1),Debug and write correct Algorim code for implement singly linked list insert front and back in algorim.,Singly linked list node creation and insertion operations.,algorim_a47 | |
| algo_a47_00498,linked_list,intermediate,linked_list_delete,O(n),O(1),Debug and write correct Algorim code for delete a node with given value from a singly linked list in algorim.,Delete first occurrence of val from linked list.,algorim_a47 | |
| algo_a47_00499,linked_list,intermediate,reverse_linked_list,O(n),O(1),Debug and write correct Algorim code for reverse a singly linked list in algorim.,Reverses a singly linked list in-place.,algorim_a47 | |
| algo_a47_00500,linked_list,beginner,list_length,O(n),O(1),Debug and write correct Algorim code for find the length of a linked list in algorim.,Returns the length of a singly linked list.,algorim_a47 | |
| algo_a47_00501,data_structures,intermediate,stack,O(1) all ops,O(n),Debug and write correct Algorim code for implement a stack data structure in algorim.,"Stack implementation using array with push, pop, peek, isEmpty.",algorim_a47 | |
| algo_a47_00502,data_structures,intermediate,balanced_parentheses,O(n),O(n),Debug and write correct Algorim code for check if an expression has balanced parentheses in algorim.,Checks if parentheses/brackets/braces are balanced using a stack.,algorim_a47 | |
| algo_a47_00503,data_structures,intermediate,queue,O(1) all ops,O(n),Debug and write correct Algorim code for implement a circular queue in algorim.,"Circular queue implementation with enqueue, dequeue, isEmpty.",algorim_a47 | |
| algo_a47_00504,trees,intermediate,bst_insert,O(h) where h=height,O(h),Debug and write correct Algorim code for implement bst insertion in algorim.,Inserts a key into a Binary Search Tree.,algorim_a47 | |
| algo_a47_00505,trees,intermediate,bst_search,O(h),O(h),Debug and write correct Algorim code for search for a key in a bst using algorim.,Searches for a key in a Binary Search Tree.,algorim_a47 | |
| algo_a47_00506,trees,beginner,inorder_traversal,O(n),O(h),Debug and write correct Algorim code for write in-order traversal of a binary tree in algorim.,In-order traversal of binary tree (Left-Root-Right).,algorim_a47 | |
| algo_a47_00507,trees,beginner,preorder_traversal,O(n),O(h),Debug and write correct Algorim code for write pre-order traversal of a binary tree in algorim.,Pre-order traversal (Root-Left-Right).,algorim_a47 | |
| algo_a47_00508,trees,beginner,postorder_traversal,O(n),O(h),Debug and write correct Algorim code for write post-order traversal of a binary tree in algorim.,Post-order traversal (Left-Right-Root).,algorim_a47 | |
| algo_a47_00509,trees,intermediate,tree_height,O(n),O(h),Debug and write correct Algorim code for find the height of a binary tree in algorim.,Computes the height (depth) of a binary tree.,algorim_a47 | |
| algo_a47_00510,trees,beginner,count_nodes,O(n),O(h),Debug and write correct Algorim code for count the number of nodes in a binary tree in algorim.,Counts total nodes in a binary tree.,algorim_a47 | |
| algo_a47_00511,trees,intermediate,level_order_traversal,O(n),O(w) w=max width,Debug and write correct Algorim code for implement level-order (bfs) traversal of a binary tree in algorim.,BFS level-order traversal of binary tree using a queue.,algorim_a47 | |
| algo_a47_00512,graphs,advanced,depth_first_search,O(V+E),O(V),Debug and write correct Algorim code for implement depth first search (dfs) in algorim.,DFS graph traversal using adjacency matrix and recursion.,algorim_a47 | |
| algo_a47_00513,graphs,advanced,breadth_first_search,O(V+E),O(V),Debug and write correct Algorim code for implement breadth first search (bfs) in algorim.,BFS graph traversal using adjacency matrix and queue.,algorim_a47 | |
| algo_a47_00514,strings,beginner,string_length,O(n),O(1),Debug and write correct Algorim code for write a string length function in algorim.,Computes string length by counting until null terminator.,algorim_a47 | |
| algo_a47_00515,strings,beginner,palindrome_check,O(n),O(1),Debug and write correct Algorim code for check if a string is a palindrome in algorim.,Checks if a string is a palindrome using two pointers.,algorim_a47 | |
| algo_a47_00516,strings,beginner,string_reverse,O(n),O(1),Debug and write correct Algorim code for reverse a string in-place in algorim.,Reverses a string in-place.,algorim_a47 | |
| algo_a47_00517,strings,beginner,string_copy,O(n),O(1),Debug and write correct Algorim code for copy a string in algorim.,Copies string src to dst.,algorim_a47 | |
| algo_a47_00518,strings,beginner,count_character,O(n),O(1),Debug and write correct Algorim code for count occurrences of a character in a string in algorim.,Counts occurrences of character c in string s.,algorim_a47 | |
| algo_a47_00519,dynamic_programming,advanced,longest_common_subsequence,O(m*n),O(m*n),Debug and write correct Algorim code for implement lcs algorithm in algorim.,Finds the length of the Longest Common Subsequence using DP.,algorim_a47 | |
| algo_a47_00520,dynamic_programming,advanced,knapsack_0_1,O(n*W),O(n*W),Debug and write correct Algorim code for implement the 0/1 knapsack problem in algorim.,0/1 Knapsack problem using bottom-up DP.,algorim_a47 | |
| algo_a47_00521,dynamic_programming,advanced,coin_change,O(amount * n),O(amount),Debug and write correct Algorim code for implement coin change problem in algorim.,Minimum number of coins to make an amount (DP).,algorim_a47 | |
| algo_a47_00522,number_theory,intermediate,sieve_eratosthenes,O(n log log n),O(n),Debug and write correct Algorim code for implement the sieve of eratosthenes in algorim.,Sieve of Eratosthenes to find all primes up to n.,algorim_a47 | |
| algo_a47_00523,number_theory,beginner,binary_to_decimal,O(n),O(1),Debug and write correct Algorim code for convert binary to decimal in algorim.,Converts binary string to decimal integer.,algorim_a47 | |
| algo_a47_00524,data_structures,advanced,hash_table,"O(1) avg, O(n) worst",O(n),Debug and write correct Algorim code for implement a hash table with chaining in algorim.,Hash table with separate chaining collision resolution.,algorim_a47 | |
| algo_a47_00525,matrix,intermediate,matrix_multiplication,O(n^3),O(1) extra,Debug and write correct Algorim code for implement matrix multiplication in algorim.,"Multiplies two n×n matrices A and B, stores result in C.",algorim_a47 | |
| algo_a47_00526,matrix,beginner,matrix_transpose,O(n^2),O(1),Debug and write correct Algorim code for transpose a matrix in-place in algorim.,Transposes a square matrix in-place.,algorim_a47 | |
| algo_a47_00527,data_structures,advanced,min_heap,O(log n) insert/extract,O(n),Debug and write correct Algorim code for implement a min-heap in algorim.,Min-heap with insert and extract_min operations.,algorim_a47 | |
| algo_a47_00528,backtracking,advanced,n_queens,O(n!),O(n^2),Debug and write correct Algorim code for solve the n-queens problem in algorim.,N-Queens problem using backtracking.,algorim_a47 | |
| algo_a47_00529,commands,beginner,imagine_command,N/A,N/A,Debug and write correct Algorim code for how do you ask the model to generate an image of an algorithm?,Command to generate a visual image of an algorithm or code.,algorim_a47 | |
| algo_a47_00530,commands,intermediate,compile_command,N/A,N/A,Debug and write correct Algorim code for how do you compile an algorim function to machine code?,Command to compile Algorim code to executable bytecode.,algorim_a47 | |
| algo_a47_00531,commands,intermediate,debug_command,N/A,N/A,Debug and write correct Algorim code for how do you debug an algorim function step by step?,Command to debug Algorim code with execution trace.,algorim_a47 | |
| algo_a47_00532,basic,beginner,swap,O(1),O(1),/compile the Algorim code for write an algorim action to swap two integers.,Exchange values of two integer variables using a temporary variable.,algorim_a47 | |
| algo_a47_00533,math,beginner,absolute_value,O(1),O(1),/compile the Algorim code for write an algorim function to compute the absolute value.,Returns the absolute value of an integer.,algorim_a47 | |
| algo_a47_00534,math,beginner,power,O(exp),O(1),/compile the Algorim code for implement a power function in algorim.,Computes base raised to the power of exp using iteration.,algorim_a47 | |
| algo_a47_00535,math,beginner,factorial,O(n),O(1),/compile the Algorim code for write the factorial function in algorim.,Computes n! iteratively.,algorim_a47 | |
| algo_a47_00536,recursion,intermediate,factorial_recursive,O(n),O(n),/compile the Algorim code for write a recursive factorial function in algorim.,Recursive factorial computation.,algorim_a47 | |
| algo_a47_00537,math,intermediate,fibonacci,O(n),O(1),/compile the Algorim code for compute the nth fibonacci number in algorim.,Computes the n-th Fibonacci number iteratively.,algorim_a47 | |
| algo_a47_00538,recursion,intermediate,fibonacci_recursive,O(2^n),O(n),/compile the Algorim code for write a recursive fibonacci function in algorim.,Recursive Fibonacci using two recursive calls.,algorim_a47 | |
| algo_a47_00539,math,intermediate,gcd,"O(log(min(a,b)))",O(1),/compile the Algorim code for implement gcd using euclidean algorithm in algorim.,Computes GCD using Euclidean algorithm.,algorim_a47 | |
| algo_a47_00540,math,intermediate,lcm,"O(log(min(a,b)))",O(1),/compile the Algorim code for write an lcm function in algorim.,Computes LCM using GCD.,algorim_a47 | |
| algo_a47_00541,math,intermediate,primality_test,O(sqrt(n)),O(1),/compile the Algorim code for write a primality test in algorim.,Checks if a number is prime using trial division up to sqrt(n).,algorim_a47 | |
| algo_a47_00542,arrays,beginner,array_sum,O(n),O(1),/compile the Algorim code for sum all elements of an array in algorim.,Sums all elements of an integer array.,algorim_a47 | |
| algo_a47_00543,arrays,beginner,find_maximum,O(n),O(1),/compile the Algorim code for find the maximum element in an array using algorim.,Finds the maximum element in an array.,algorim_a47 | |
| algo_a47_00544,arrays,beginner,find_minimum,O(n),O(1),/compile the Algorim code for find the minimum element in an array using algorim.,Finds the minimum element in an array.,algorim_a47 | |
| algo_a47_00545,searching,beginner,linear_search,O(n),O(1),/compile the Algorim code for implement linear search in algorim.,"Searches for target in array, returns index or -1.",algorim_a47 | |
| algo_a47_00546,searching,intermediate,binary_search,O(log n),O(1),/compile the Algorim code for write binary search in algorim for a sorted array.,Binary search on sorted array. Returns index or -1.,algorim_a47 | |
| algo_a47_00547,arrays,beginner,reverse_array,O(n),O(1),/compile the Algorim code for reverse an array in-place in algorim.,Reverses an array in-place using two pointers.,algorim_a47 | |
| algo_a47_00548,arrays,beginner,count_occurrences,O(n),O(1),/compile the Algorim code for count occurrences of a value in an array using algorim.,Counts occurrences of val in array T.,algorim_a47 | |
| algo_a47_00549,arrays,beginner,copy_array,O(n),O(1),/compile the Algorim code for write an array copy function in algorim.,Copies elements from src to dst array.,algorim_a47 | |
| algo_a47_00550,sorting,beginner,bubble_sort,O(n^2),O(1),/compile the Algorim code for implement bubble sort in algorim.,Bubble sort with early exit optimization.,algorim_a47 | |
| algo_a47_00551,sorting,beginner,selection_sort,O(n^2),O(1),/compile the Algorim code for implement selection sort in algorim.,Selection sort: finds minimum and places it at front.,algorim_a47 | |
| algo_a47_00552,sorting,intermediate,insertion_sort,O(n^2),O(1),/compile the Algorim code for implement insertion sort in algorim.,Insertion sort: builds sorted array one element at a time.,algorim_a47 | |
| algo_a47_00553,sorting,advanced,merge_sort,O(n log n),O(n),/compile the Algorim code for implement merge sort in algorim.,Merge sort: divide-and-conquer stable sorting algorithm.,algorim_a47 | |
| algo_a47_00554,sorting,advanced,quick_sort,"O(n log n) avg, O(n^2) worst",O(log n),/compile the Algorim code for implement quick sort in algorim.,Quick sort with last element as pivot using Lomuto partition.,algorim_a47 | |
| algo_a47_00555,sorting,advanced,heap_sort,O(n log n),O(1),/compile the Algorim code for implement heap sort in algorim.,Heap sort using max-heap.,algorim_a47 | |
| algo_a47_00556,linked_list,intermediate,linked_list_basic,"O(1) front, O(n) back",O(1),/compile the Algorim code for implement singly linked list insert front and back in algorim.,Singly linked list node creation and insertion operations.,algorim_a47 | |
| algo_a47_00557,linked_list,intermediate,linked_list_delete,O(n),O(1),/compile the Algorim code for delete a node with given value from a singly linked list in algorim.,Delete first occurrence of val from linked list.,algorim_a47 | |
| algo_a47_00558,linked_list,intermediate,reverse_linked_list,O(n),O(1),/compile the Algorim code for reverse a singly linked list in algorim.,Reverses a singly linked list in-place.,algorim_a47 | |
| algo_a47_00559,linked_list,beginner,list_length,O(n),O(1),/compile the Algorim code for find the length of a linked list in algorim.,Returns the length of a singly linked list.,algorim_a47 | |
| algo_a47_00560,data_structures,intermediate,stack,O(1) all ops,O(n),/compile the Algorim code for implement a stack data structure in algorim.,"Stack implementation using array with push, pop, peek, isEmpty.",algorim_a47 | |
| algo_a47_00561,data_structures,intermediate,balanced_parentheses,O(n),O(n),/compile the Algorim code for check if an expression has balanced parentheses in algorim.,Checks if parentheses/brackets/braces are balanced using a stack.,algorim_a47 | |
| algo_a47_00562,data_structures,intermediate,queue,O(1) all ops,O(n),/compile the Algorim code for implement a circular queue in algorim.,"Circular queue implementation with enqueue, dequeue, isEmpty.",algorim_a47 | |
| algo_a47_00563,trees,intermediate,bst_insert,O(h) where h=height,O(h),/compile the Algorim code for implement bst insertion in algorim.,Inserts a key into a Binary Search Tree.,algorim_a47 | |
| algo_a47_00564,trees,intermediate,bst_search,O(h),O(h),/compile the Algorim code for search for a key in a bst using algorim.,Searches for a key in a Binary Search Tree.,algorim_a47 | |
| algo_a47_00565,trees,beginner,inorder_traversal,O(n),O(h),/compile the Algorim code for write in-order traversal of a binary tree in algorim.,In-order traversal of binary tree (Left-Root-Right).,algorim_a47 | |
| algo_a47_00566,trees,beginner,preorder_traversal,O(n),O(h),/compile the Algorim code for write pre-order traversal of a binary tree in algorim.,Pre-order traversal (Root-Left-Right).,algorim_a47 | |
| algo_a47_00567,trees,beginner,postorder_traversal,O(n),O(h),/compile the Algorim code for write post-order traversal of a binary tree in algorim.,Post-order traversal (Left-Right-Root).,algorim_a47 | |
| algo_a47_00568,trees,intermediate,tree_height,O(n),O(h),/compile the Algorim code for find the height of a binary tree in algorim.,Computes the height (depth) of a binary tree.,algorim_a47 | |
| algo_a47_00569,trees,beginner,count_nodes,O(n),O(h),/compile the Algorim code for count the number of nodes in a binary tree in algorim.,Counts total nodes in a binary tree.,algorim_a47 | |
| algo_a47_00570,trees,intermediate,level_order_traversal,O(n),O(w) w=max width,/compile the Algorim code for implement level-order (bfs) traversal of a binary tree in algorim.,BFS level-order traversal of binary tree using a queue.,algorim_a47 | |
| algo_a47_00571,graphs,advanced,depth_first_search,O(V+E),O(V),/compile the Algorim code for implement depth first search (dfs) in algorim.,DFS graph traversal using adjacency matrix and recursion.,algorim_a47 | |
| algo_a47_00572,graphs,advanced,breadth_first_search,O(V+E),O(V),/compile the Algorim code for implement breadth first search (bfs) in algorim.,BFS graph traversal using adjacency matrix and queue.,algorim_a47 | |
| algo_a47_00573,strings,beginner,string_length,O(n),O(1),/compile the Algorim code for write a string length function in algorim.,Computes string length by counting until null terminator.,algorim_a47 | |
| algo_a47_00574,strings,beginner,palindrome_check,O(n),O(1),/compile the Algorim code for check if a string is a palindrome in algorim.,Checks if a string is a palindrome using two pointers.,algorim_a47 | |
| algo_a47_00575,strings,beginner,string_reverse,O(n),O(1),/compile the Algorim code for reverse a string in-place in algorim.,Reverses a string in-place.,algorim_a47 | |
| algo_a47_00576,strings,beginner,string_copy,O(n),O(1),/compile the Algorim code for copy a string in algorim.,Copies string src to dst.,algorim_a47 | |
| algo_a47_00577,strings,beginner,count_character,O(n),O(1),/compile the Algorim code for count occurrences of a character in a string in algorim.,Counts occurrences of character c in string s.,algorim_a47 | |
| algo_a47_00578,dynamic_programming,advanced,longest_common_subsequence,O(m*n),O(m*n),/compile the Algorim code for implement lcs algorithm in algorim.,Finds the length of the Longest Common Subsequence using DP.,algorim_a47 | |
| algo_a47_00579,dynamic_programming,advanced,knapsack_0_1,O(n*W),O(n*W),/compile the Algorim code for implement the 0/1 knapsack problem in algorim.,0/1 Knapsack problem using bottom-up DP.,algorim_a47 | |
| algo_a47_00580,dynamic_programming,advanced,coin_change,O(amount * n),O(amount),/compile the Algorim code for implement coin change problem in algorim.,Minimum number of coins to make an amount (DP).,algorim_a47 | |
| algo_a47_00581,number_theory,intermediate,sieve_eratosthenes,O(n log log n),O(n),/compile the Algorim code for implement the sieve of eratosthenes in algorim.,Sieve of Eratosthenes to find all primes up to n.,algorim_a47 | |
| algo_a47_00582,number_theory,beginner,binary_to_decimal,O(n),O(1),/compile the Algorim code for convert binary to decimal in algorim.,Converts binary string to decimal integer.,algorim_a47 | |
| algo_a47_00583,data_structures,advanced,hash_table,"O(1) avg, O(n) worst",O(n),/compile the Algorim code for implement a hash table with chaining in algorim.,Hash table with separate chaining collision resolution.,algorim_a47 | |
| algo_a47_00584,matrix,intermediate,matrix_multiplication,O(n^3),O(1) extra,/compile the Algorim code for implement matrix multiplication in algorim.,"Multiplies two n×n matrices A and B, stores result in C.",algorim_a47 | |
| algo_a47_00585,matrix,beginner,matrix_transpose,O(n^2),O(1),/compile the Algorim code for transpose a matrix in-place in algorim.,Transposes a square matrix in-place.,algorim_a47 | |
| algo_a47_00586,data_structures,advanced,min_heap,O(log n) insert/extract,O(n),/compile the Algorim code for implement a min-heap in algorim.,Min-heap with insert and extract_min operations.,algorim_a47 | |
| algo_a47_00587,backtracking,advanced,n_queens,O(n!),O(n^2),/compile the Algorim code for solve the n-queens problem in algorim.,N-Queens problem using backtracking.,algorim_a47 | |
| algo_a47_00588,commands,beginner,imagine_command,N/A,N/A,/compile the Algorim code for how do you ask the model to generate an image of an algorithm?,Command to generate a visual image of an algorithm or code.,algorim_a47 | |
| algo_a47_00589,commands,intermediate,compile_command,N/A,N/A,/compile the Algorim code for how do you compile an algorim function to machine code?,Command to compile Algorim code to executable bytecode.,algorim_a47 | |
| algo_a47_00590,commands,intermediate,debug_command,N/A,N/A,/compile the Algorim code for how do you debug an algorim function step by step?,Command to debug Algorim code with execution trace.,algorim_a47 | |
| algo_a47_00591,basic,beginner,swap,O(1),O(1),Write an Algorim action to write an algorim action to swap two integers.,Exchange values of two integer variables using a temporary variable.,algorim_a47 | |
| algo_a47_00592,math,beginner,absolute_value,O(1),O(1),Write an Algorim action to write an algorim function to compute the absolute value.,Returns the absolute value of an integer.,algorim_a47 | |
| algo_a47_00593,math,beginner,power,O(exp),O(1),Write an Algorim action to implement a power function in algorim.,Computes base raised to the power of exp using iteration.,algorim_a47 | |
| algo_a47_00594,math,beginner,factorial,O(n),O(1),Write an Algorim action to write the factorial function in algorim.,Computes n! iteratively.,algorim_a47 | |
| algo_a47_00595,recursion,intermediate,factorial_recursive,O(n),O(n),Write an Algorim action to write a recursive factorial function in algorim.,Recursive factorial computation.,algorim_a47 | |
| algo_a47_00596,math,intermediate,fibonacci,O(n),O(1),Write an Algorim action to compute the nth fibonacci number in algorim.,Computes the n-th Fibonacci number iteratively.,algorim_a47 | |
| algo_a47_00597,recursion,intermediate,fibonacci_recursive,O(2^n),O(n),Write an Algorim action to write a recursive fibonacci function in algorim.,Recursive Fibonacci using two recursive calls.,algorim_a47 | |
| algo_a47_00598,math,intermediate,gcd,"O(log(min(a,b)))",O(1),Write an Algorim action to implement gcd using euclidean algorithm in algorim.,Computes GCD using Euclidean algorithm.,algorim_a47 | |
| algo_a47_00599,math,intermediate,lcm,"O(log(min(a,b)))",O(1),Write an Algorim action to write an lcm function in algorim.,Computes LCM using GCD.,algorim_a47 | |
| algo_a47_00600,math,intermediate,primality_test,O(sqrt(n)),O(1),Write an Algorim action to write a primality test in algorim.,Checks if a number is prime using trial division up to sqrt(n).,algorim_a47 | |
| algo_a47_00601,arrays,beginner,array_sum,O(n),O(1),Write an Algorim action to sum all elements of an array in algorim.,Sums all elements of an integer array.,algorim_a47 | |
| algo_a47_00602,arrays,beginner,find_maximum,O(n),O(1),Write an Algorim action to find the maximum element in an array using algorim.,Finds the maximum element in an array.,algorim_a47 | |
| algo_a47_00603,arrays,beginner,find_minimum,O(n),O(1),Write an Algorim action to find the minimum element in an array using algorim.,Finds the minimum element in an array.,algorim_a47 | |
| algo_a47_00604,searching,beginner,linear_search,O(n),O(1),Write an Algorim action to implement linear search in algorim.,"Searches for target in array, returns index or -1.",algorim_a47 | |
| algo_a47_00605,searching,intermediate,binary_search,O(log n),O(1),Write an Algorim action to write binary search in algorim for a sorted array.,Binary search on sorted array. Returns index or -1.,algorim_a47 | |
| algo_a47_00606,arrays,beginner,reverse_array,O(n),O(1),Write an Algorim action to reverse an array in-place in algorim.,Reverses an array in-place using two pointers.,algorim_a47 | |
| algo_a47_00607,arrays,beginner,count_occurrences,O(n),O(1),Write an Algorim action to count occurrences of a value in an array using algorim.,Counts occurrences of val in array T.,algorim_a47 | |
| algo_a47_00608,arrays,beginner,copy_array,O(n),O(1),Write an Algorim action to write an array copy function in algorim.,Copies elements from src to dst array.,algorim_a47 | |
| algo_a47_00609,sorting,beginner,bubble_sort,O(n^2),O(1),Write an Algorim action to implement bubble sort in algorim.,Bubble sort with early exit optimization.,algorim_a47 | |
| algo_a47_00610,sorting,beginner,selection_sort,O(n^2),O(1),Write an Algorim action to implement selection sort in algorim.,Selection sort: finds minimum and places it at front.,algorim_a47 | |
| algo_a47_00611,sorting,intermediate,insertion_sort,O(n^2),O(1),Write an Algorim action to implement insertion sort in algorim.,Insertion sort: builds sorted array one element at a time.,algorim_a47 | |
| algo_a47_00612,sorting,advanced,merge_sort,O(n log n),O(n),Write an Algorim action to implement merge sort in algorim.,Merge sort: divide-and-conquer stable sorting algorithm.,algorim_a47 | |
| algo_a47_00613,sorting,advanced,quick_sort,"O(n log n) avg, O(n^2) worst",O(log n),Write an Algorim action to implement quick sort in algorim.,Quick sort with last element as pivot using Lomuto partition.,algorim_a47 | |
| algo_a47_00614,sorting,advanced,heap_sort,O(n log n),O(1),Write an Algorim action to implement heap sort in algorim.,Heap sort using max-heap.,algorim_a47 | |
| algo_a47_00615,linked_list,intermediate,linked_list_basic,"O(1) front, O(n) back",O(1),Write an Algorim action to implement singly linked list insert front and back in algorim.,Singly linked list node creation and insertion operations.,algorim_a47 | |
| algo_a47_00616,linked_list,intermediate,linked_list_delete,O(n),O(1),Write an Algorim action to delete a node with given value from a singly linked list in algorim.,Delete first occurrence of val from linked list.,algorim_a47 | |
| algo_a47_00617,linked_list,intermediate,reverse_linked_list,O(n),O(1),Write an Algorim action to reverse a singly linked list in algorim.,Reverses a singly linked list in-place.,algorim_a47 | |
| algo_a47_00618,linked_list,beginner,list_length,O(n),O(1),Write an Algorim action to find the length of a linked list in algorim.,Returns the length of a singly linked list.,algorim_a47 | |
| algo_a47_00619,data_structures,intermediate,stack,O(1) all ops,O(n),Write an Algorim action to implement a stack data structure in algorim.,"Stack implementation using array with push, pop, peek, isEmpty.",algorim_a47 | |
| algo_a47_00620,data_structures,intermediate,balanced_parentheses,O(n),O(n),Write an Algorim action to check if an expression has balanced parentheses in algorim.,Checks if parentheses/brackets/braces are balanced using a stack.,algorim_a47 | |
| algo_a47_00621,data_structures,intermediate,queue,O(1) all ops,O(n),Write an Algorim action to implement a circular queue in algorim.,"Circular queue implementation with enqueue, dequeue, isEmpty.",algorim_a47 | |
| algo_a47_00622,trees,intermediate,bst_insert,O(h) where h=height,O(h),Write an Algorim action to implement bst insertion in algorim.,Inserts a key into a Binary Search Tree.,algorim_a47 | |
| algo_a47_00623,trees,intermediate,bst_search,O(h),O(h),Write an Algorim action to search for a key in a bst using algorim.,Searches for a key in a Binary Search Tree.,algorim_a47 | |
| algo_a47_00624,trees,beginner,inorder_traversal,O(n),O(h),Write an Algorim action to write in-order traversal of a binary tree in algorim.,In-order traversal of binary tree (Left-Root-Right).,algorim_a47 | |
| algo_a47_00625,trees,beginner,preorder_traversal,O(n),O(h),Write an Algorim action to write pre-order traversal of a binary tree in algorim.,Pre-order traversal (Root-Left-Right).,algorim_a47 | |
| algo_a47_00626,trees,beginner,postorder_traversal,O(n),O(h),Write an Algorim action to write post-order traversal of a binary tree in algorim.,Post-order traversal (Left-Right-Root).,algorim_a47 | |
| algo_a47_00627,trees,intermediate,tree_height,O(n),O(h),Write an Algorim action to find the height of a binary tree in algorim.,Computes the height (depth) of a binary tree.,algorim_a47 | |
| algo_a47_00628,trees,beginner,count_nodes,O(n),O(h),Write an Algorim action to count the number of nodes in a binary tree in algorim.,Counts total nodes in a binary tree.,algorim_a47 | |
| algo_a47_00629,trees,intermediate,level_order_traversal,O(n),O(w) w=max width,Write an Algorim action to implement level-order (bfs) traversal of a binary tree in algorim.,BFS level-order traversal of binary tree using a queue.,algorim_a47 | |
| algo_a47_00630,graphs,advanced,depth_first_search,O(V+E),O(V),Write an Algorim action to implement depth first search (dfs) in algorim.,DFS graph traversal using adjacency matrix and recursion.,algorim_a47 | |
| algo_a47_00631,graphs,advanced,breadth_first_search,O(V+E),O(V),Write an Algorim action to implement breadth first search (bfs) in algorim.,BFS graph traversal using adjacency matrix and queue.,algorim_a47 | |
| algo_a47_00632,strings,beginner,string_length,O(n),O(1),Write an Algorim action to write a string length function in algorim.,Computes string length by counting until null terminator.,algorim_a47 | |
| algo_a47_00633,strings,beginner,palindrome_check,O(n),O(1),Write an Algorim action to check if a string is a palindrome in algorim.,Checks if a string is a palindrome using two pointers.,algorim_a47 | |
| algo_a47_00634,strings,beginner,string_reverse,O(n),O(1),Write an Algorim action to reverse a string in-place in algorim.,Reverses a string in-place.,algorim_a47 | |
| algo_a47_00635,strings,beginner,string_copy,O(n),O(1),Write an Algorim action to copy a string in algorim.,Copies string src to dst.,algorim_a47 | |
| algo_a47_00636,strings,beginner,count_character,O(n),O(1),Write an Algorim action to count occurrences of a character in a string in algorim.,Counts occurrences of character c in string s.,algorim_a47 | |
| algo_a47_00637,dynamic_programming,advanced,longest_common_subsequence,O(m*n),O(m*n),Write an Algorim action to implement lcs algorithm in algorim.,Finds the length of the Longest Common Subsequence using DP.,algorim_a47 | |
| algo_a47_00638,dynamic_programming,advanced,knapsack_0_1,O(n*W),O(n*W),Write an Algorim action to implement the 0/1 knapsack problem in algorim.,0/1 Knapsack problem using bottom-up DP.,algorim_a47 | |
| algo_a47_00639,dynamic_programming,advanced,coin_change,O(amount * n),O(amount),Write an Algorim action to implement coin change problem in algorim.,Minimum number of coins to make an amount (DP).,algorim_a47 | |
| algo_a47_00640,number_theory,intermediate,sieve_eratosthenes,O(n log log n),O(n),Write an Algorim action to implement the sieve of eratosthenes in algorim.,Sieve of Eratosthenes to find all primes up to n.,algorim_a47 | |
| algo_a47_00641,number_theory,beginner,binary_to_decimal,O(n),O(1),Write an Algorim action to convert binary to decimal in algorim.,Converts binary string to decimal integer.,algorim_a47 | |
| algo_a47_00642,data_structures,advanced,hash_table,"O(1) avg, O(n) worst",O(n),Write an Algorim action to implement a hash table with chaining in algorim.,Hash table with separate chaining collision resolution.,algorim_a47 | |
| algo_a47_00643,matrix,intermediate,matrix_multiplication,O(n^3),O(1) extra,Write an Algorim action to implement matrix multiplication in algorim.,"Multiplies two n×n matrices A and B, stores result in C.",algorim_a47 | |
| algo_a47_00644,matrix,beginner,matrix_transpose,O(n^2),O(1),Write an Algorim action to transpose a matrix in-place in algorim.,Transposes a square matrix in-place.,algorim_a47 | |
| algo_a47_00645,data_structures,advanced,min_heap,O(log n) insert/extract,O(n),Write an Algorim action to implement a min-heap in algorim.,Min-heap with insert and extract_min operations.,algorim_a47 | |
| algo_a47_00646,backtracking,advanced,n_queens,O(n!),O(n^2),Write an Algorim action to solve the n-queens problem in algorim.,N-Queens problem using backtracking.,algorim_a47 | |
| algo_a47_00647,commands,beginner,imagine_command,N/A,N/A,Write an Algorim action to how do you ask the model to generate an image of an algorithm?,Command to generate a visual image of an algorithm or code.,algorim_a47 | |
| algo_a47_00648,commands,intermediate,compile_command,N/A,N/A,Write an Algorim action to how do you compile an algorim function to machine code?,Command to compile Algorim code to executable bytecode.,algorim_a47 | |
| algo_a47_00649,commands,intermediate,debug_command,N/A,N/A,Write an Algorim action to how do you debug an algorim function step by step?,Command to debug Algorim code with execution trace.,algorim_a47 | |
| algo_a47_00650,basic,beginner,swap,O(1),O(1),Implement in Algorim language: write an algorim action to swap two integers.,Exchange values of two integer variables using a temporary variable.,algorim_a47 | |
| algo_a47_00651,math,beginner,absolute_value,O(1),O(1),Implement in Algorim language: write an algorim function to compute the absolute value.,Returns the absolute value of an integer.,algorim_a47 | |
| algo_a47_00652,math,beginner,power,O(exp),O(1),Implement in Algorim language: implement a power function in algorim.,Computes base raised to the power of exp using iteration.,algorim_a47 | |
| algo_a47_00653,math,beginner,factorial,O(n),O(1),Implement in Algorim language: write the factorial function in algorim.,Computes n! iteratively.,algorim_a47 | |
| algo_a47_00654,recursion,intermediate,factorial_recursive,O(n),O(n),Implement in Algorim language: write a recursive factorial function in algorim.,Recursive factorial computation.,algorim_a47 | |
| algo_a47_00655,math,intermediate,fibonacci,O(n),O(1),Implement in Algorim language: compute the nth fibonacci number in algorim.,Computes the n-th Fibonacci number iteratively.,algorim_a47 | |
| algo_a47_00656,recursion,intermediate,fibonacci_recursive,O(2^n),O(n),Implement in Algorim language: write a recursive fibonacci function in algorim.,Recursive Fibonacci using two recursive calls.,algorim_a47 | |
| algo_a47_00657,math,intermediate,gcd,"O(log(min(a,b)))",O(1),Implement in Algorim language: implement gcd using euclidean algorithm in algorim.,Computes GCD using Euclidean algorithm.,algorim_a47 | |
| algo_a47_00658,math,intermediate,lcm,"O(log(min(a,b)))",O(1),Implement in Algorim language: write an lcm function in algorim.,Computes LCM using GCD.,algorim_a47 | |
| algo_a47_00659,math,intermediate,primality_test,O(sqrt(n)),O(1),Implement in Algorim language: write a primality test in algorim.,Checks if a number is prime using trial division up to sqrt(n).,algorim_a47 | |
| algo_a47_00660,arrays,beginner,array_sum,O(n),O(1),Implement in Algorim language: sum all elements of an array in algorim.,Sums all elements of an integer array.,algorim_a47 | |
| algo_a47_00661,arrays,beginner,find_maximum,O(n),O(1),Implement in Algorim language: find the maximum element in an array using algorim.,Finds the maximum element in an array.,algorim_a47 | |
| algo_a47_00662,arrays,beginner,find_minimum,O(n),O(1),Implement in Algorim language: find the minimum element in an array using algorim.,Finds the minimum element in an array.,algorim_a47 | |
| algo_a47_00663,searching,beginner,linear_search,O(n),O(1),Implement in Algorim language: implement linear search in algorim.,"Searches for target in array, returns index or -1.",algorim_a47 | |
| algo_a47_00664,searching,intermediate,binary_search,O(log n),O(1),Implement in Algorim language: write binary search in algorim for a sorted array.,Binary search on sorted array. Returns index or -1.,algorim_a47 | |
| algo_a47_00665,arrays,beginner,reverse_array,O(n),O(1),Implement in Algorim language: reverse an array in-place in algorim.,Reverses an array in-place using two pointers.,algorim_a47 | |
| algo_a47_00666,arrays,beginner,count_occurrences,O(n),O(1),Implement in Algorim language: count occurrences of a value in an array using algorim.,Counts occurrences of val in array T.,algorim_a47 | |
| algo_a47_00667,arrays,beginner,copy_array,O(n),O(1),Implement in Algorim language: write an array copy function in algorim.,Copies elements from src to dst array.,algorim_a47 | |
| algo_a47_00668,sorting,beginner,bubble_sort,O(n^2),O(1),Implement in Algorim language: implement bubble sort in algorim.,Bubble sort with early exit optimization.,algorim_a47 | |
| algo_a47_00669,sorting,beginner,selection_sort,O(n^2),O(1),Implement in Algorim language: implement selection sort in algorim.,Selection sort: finds minimum and places it at front.,algorim_a47 | |
| algo_a47_00670,sorting,intermediate,insertion_sort,O(n^2),O(1),Implement in Algorim language: implement insertion sort in algorim.,Insertion sort: builds sorted array one element at a time.,algorim_a47 | |
| algo_a47_00671,sorting,advanced,merge_sort,O(n log n),O(n),Implement in Algorim language: implement merge sort in algorim.,Merge sort: divide-and-conquer stable sorting algorithm.,algorim_a47 | |
| algo_a47_00672,sorting,advanced,quick_sort,"O(n log n) avg, O(n^2) worst",O(log n),Implement in Algorim language: implement quick sort in algorim.,Quick sort with last element as pivot using Lomuto partition.,algorim_a47 | |
| algo_a47_00673,sorting,advanced,heap_sort,O(n log n),O(1),Implement in Algorim language: implement heap sort in algorim.,Heap sort using max-heap.,algorim_a47 | |
| algo_a47_00674,linked_list,intermediate,linked_list_basic,"O(1) front, O(n) back",O(1),Implement in Algorim language: implement singly linked list insert front and back in algorim.,Singly linked list node creation and insertion operations.,algorim_a47 | |
| algo_a47_00675,linked_list,intermediate,linked_list_delete,O(n),O(1),Implement in Algorim language: delete a node with given value from a singly linked list in algorim.,Delete first occurrence of val from linked list.,algorim_a47 | |
| algo_a47_00676,linked_list,intermediate,reverse_linked_list,O(n),O(1),Implement in Algorim language: reverse a singly linked list in algorim.,Reverses a singly linked list in-place.,algorim_a47 | |
| algo_a47_00677,linked_list,beginner,list_length,O(n),O(1),Implement in Algorim language: find the length of a linked list in algorim.,Returns the length of a singly linked list.,algorim_a47 | |
| algo_a47_00678,data_structures,intermediate,stack,O(1) all ops,O(n),Implement in Algorim language: implement a stack data structure in algorim.,"Stack implementation using array with push, pop, peek, isEmpty.",algorim_a47 | |
| algo_a47_00679,data_structures,intermediate,balanced_parentheses,O(n),O(n),Implement in Algorim language: check if an expression has balanced parentheses in algorim.,Checks if parentheses/brackets/braces are balanced using a stack.,algorim_a47 | |
| algo_a47_00680,data_structures,intermediate,queue,O(1) all ops,O(n),Implement in Algorim language: implement a circular queue in algorim.,"Circular queue implementation with enqueue, dequeue, isEmpty.",algorim_a47 | |
| algo_a47_00681,trees,intermediate,bst_insert,O(h) where h=height,O(h),Implement in Algorim language: implement bst insertion in algorim.,Inserts a key into a Binary Search Tree.,algorim_a47 | |
| algo_a47_00682,trees,intermediate,bst_search,O(h),O(h),Implement in Algorim language: search for a key in a bst using algorim.,Searches for a key in a Binary Search Tree.,algorim_a47 | |
| algo_a47_00683,trees,beginner,inorder_traversal,O(n),O(h),Implement in Algorim language: write in-order traversal of a binary tree in algorim.,In-order traversal of binary tree (Left-Root-Right).,algorim_a47 | |
| algo_a47_00684,trees,beginner,preorder_traversal,O(n),O(h),Implement in Algorim language: write pre-order traversal of a binary tree in algorim.,Pre-order traversal (Root-Left-Right).,algorim_a47 | |
| algo_a47_00685,trees,beginner,postorder_traversal,O(n),O(h),Implement in Algorim language: write post-order traversal of a binary tree in algorim.,Post-order traversal (Left-Right-Root).,algorim_a47 | |
| algo_a47_00686,trees,intermediate,tree_height,O(n),O(h),Implement in Algorim language: find the height of a binary tree in algorim.,Computes the height (depth) of a binary tree.,algorim_a47 | |
| algo_a47_00687,trees,beginner,count_nodes,O(n),O(h),Implement in Algorim language: count the number of nodes in a binary tree in algorim.,Counts total nodes in a binary tree.,algorim_a47 | |
| algo_a47_00688,trees,intermediate,level_order_traversal,O(n),O(w) w=max width,Implement in Algorim language: implement level-order (bfs) traversal of a binary tree in algorim.,BFS level-order traversal of binary tree using a queue.,algorim_a47 | |
| algo_a47_00689,graphs,advanced,depth_first_search,O(V+E),O(V),Implement in Algorim language: implement depth first search (dfs) in algorim.,DFS graph traversal using adjacency matrix and recursion.,algorim_a47 | |
| algo_a47_00690,graphs,advanced,breadth_first_search,O(V+E),O(V),Implement in Algorim language: implement breadth first search (bfs) in algorim.,BFS graph traversal using adjacency matrix and queue.,algorim_a47 | |
| algo_a47_00691,strings,beginner,string_length,O(n),O(1),Implement in Algorim language: write a string length function in algorim.,Computes string length by counting until null terminator.,algorim_a47 | |
| algo_a47_00692,strings,beginner,palindrome_check,O(n),O(1),Implement in Algorim language: check if a string is a palindrome in algorim.,Checks if a string is a palindrome using two pointers.,algorim_a47 | |
| algo_a47_00693,strings,beginner,string_reverse,O(n),O(1),Implement in Algorim language: reverse a string in-place in algorim.,Reverses a string in-place.,algorim_a47 | |
| algo_a47_00694,strings,beginner,string_copy,O(n),O(1),Implement in Algorim language: copy a string in algorim.,Copies string src to dst.,algorim_a47 | |
| algo_a47_00695,strings,beginner,count_character,O(n),O(1),Implement in Algorim language: count occurrences of a character in a string in algorim.,Counts occurrences of character c in string s.,algorim_a47 | |
| algo_a47_00696,dynamic_programming,advanced,longest_common_subsequence,O(m*n),O(m*n),Implement in Algorim language: implement lcs algorithm in algorim.,Finds the length of the Longest Common Subsequence using DP.,algorim_a47 | |
| algo_a47_00697,dynamic_programming,advanced,knapsack_0_1,O(n*W),O(n*W),Implement in Algorim language: implement the 0/1 knapsack problem in algorim.,0/1 Knapsack problem using bottom-up DP.,algorim_a47 | |
| algo_a47_00698,dynamic_programming,advanced,coin_change,O(amount * n),O(amount),Implement in Algorim language: implement coin change problem in algorim.,Minimum number of coins to make an amount (DP).,algorim_a47 | |
| algo_a47_00699,number_theory,intermediate,sieve_eratosthenes,O(n log log n),O(n),Implement in Algorim language: implement the sieve of eratosthenes in algorim.,Sieve of Eratosthenes to find all primes up to n.,algorim_a47 | |
| algo_a47_00700,number_theory,beginner,binary_to_decimal,O(n),O(1),Implement in Algorim language: convert binary to decimal in algorim.,Converts binary string to decimal integer.,algorim_a47 | |
| algo_a47_00701,data_structures,advanced,hash_table,"O(1) avg, O(n) worst",O(n),Implement in Algorim language: implement a hash table with chaining in algorim.,Hash table with separate chaining collision resolution.,algorim_a47 | |
| algo_a47_00702,matrix,intermediate,matrix_multiplication,O(n^3),O(1) extra,Implement in Algorim language: implement matrix multiplication in algorim.,"Multiplies two n×n matrices A and B, stores result in C.",algorim_a47 | |
| algo_a47_00703,matrix,beginner,matrix_transpose,O(n^2),O(1),Implement in Algorim language: transpose a matrix in-place in algorim.,Transposes a square matrix in-place.,algorim_a47 | |
| algo_a47_00704,data_structures,advanced,min_heap,O(log n) insert/extract,O(n),Implement in Algorim language: implement a min-heap in algorim.,Min-heap with insert and extract_min operations.,algorim_a47 | |
| algo_a47_00705,backtracking,advanced,n_queens,O(n!),O(n^2),Implement in Algorim language: solve the n-queens problem in algorim.,N-Queens problem using backtracking.,algorim_a47 | |
| algo_a47_00706,commands,beginner,imagine_command,N/A,N/A,Implement in Algorim language: how do you ask the model to generate an image of an algorithm?,Command to generate a visual image of an algorithm or code.,algorim_a47 | |
| algo_a47_00707,commands,intermediate,compile_command,N/A,N/A,Implement in Algorim language: how do you compile an algorim function to machine code?,Command to compile Algorim code to executable bytecode.,algorim_a47 | |
| algo_a47_00708,commands,intermediate,debug_command,N/A,N/A,Implement in Algorim language: how do you debug an algorim function step by step?,Command to debug Algorim code with execution trace.,algorim_a47 | |
| algo_a47_00709,basic,beginner,swap,O(1),O(1),Code the following in Algorim (algo a47): write an algorim action to swap two integers.,Exchange values of two integer variables using a temporary variable.,algorim_a47 | |
| algo_a47_00710,math,beginner,absolute_value,O(1),O(1),Code the following in Algorim (algo a47): write an algorim function to compute the absolute value.,Returns the absolute value of an integer.,algorim_a47 | |
| algo_a47_00711,math,beginner,power,O(exp),O(1),Code the following in Algorim (algo a47): implement a power function in algorim.,Computes base raised to the power of exp using iteration.,algorim_a47 | |
| algo_a47_00712,math,beginner,factorial,O(n),O(1),Code the following in Algorim (algo a47): write the factorial function in algorim.,Computes n! iteratively.,algorim_a47 | |
| algo_a47_00713,recursion,intermediate,factorial_recursive,O(n),O(n),Code the following in Algorim (algo a47): write a recursive factorial function in algorim.,Recursive factorial computation.,algorim_a47 | |
| algo_a47_00714,math,intermediate,fibonacci,O(n),O(1),Code the following in Algorim (algo a47): compute the nth fibonacci number in algorim.,Computes the n-th Fibonacci number iteratively.,algorim_a47 | |
| algo_a47_00715,recursion,intermediate,fibonacci_recursive,O(2^n),O(n),Code the following in Algorim (algo a47): write a recursive fibonacci function in algorim.,Recursive Fibonacci using two recursive calls.,algorim_a47 | |
| algo_a47_00716,math,intermediate,gcd,"O(log(min(a,b)))",O(1),Code the following in Algorim (algo a47): implement gcd using euclidean algorithm in algorim.,Computes GCD using Euclidean algorithm.,algorim_a47 | |
| algo_a47_00717,math,intermediate,lcm,"O(log(min(a,b)))",O(1),Code the following in Algorim (algo a47): write an lcm function in algorim.,Computes LCM using GCD.,algorim_a47 | |
| algo_a47_00718,math,intermediate,primality_test,O(sqrt(n)),O(1),Code the following in Algorim (algo a47): write a primality test in algorim.,Checks if a number is prime using trial division up to sqrt(n).,algorim_a47 | |
| algo_a47_00719,arrays,beginner,array_sum,O(n),O(1),Code the following in Algorim (algo a47): sum all elements of an array in algorim.,Sums all elements of an integer array.,algorim_a47 | |
| algo_a47_00720,arrays,beginner,find_maximum,O(n),O(1),Code the following in Algorim (algo a47): find the maximum element in an array using algorim.,Finds the maximum element in an array.,algorim_a47 | |
| algo_a47_00721,arrays,beginner,find_minimum,O(n),O(1),Code the following in Algorim (algo a47): find the minimum element in an array using algorim.,Finds the minimum element in an array.,algorim_a47 | |
| algo_a47_00722,searching,beginner,linear_search,O(n),O(1),Code the following in Algorim (algo a47): implement linear search in algorim.,"Searches for target in array, returns index or -1.",algorim_a47 | |
| algo_a47_00723,searching,intermediate,binary_search,O(log n),O(1),Code the following in Algorim (algo a47): write binary search in algorim for a sorted array.,Binary search on sorted array. Returns index or -1.,algorim_a47 | |
| algo_a47_00724,arrays,beginner,reverse_array,O(n),O(1),Code the following in Algorim (algo a47): reverse an array in-place in algorim.,Reverses an array in-place using two pointers.,algorim_a47 | |
| algo_a47_00725,arrays,beginner,count_occurrences,O(n),O(1),Code the following in Algorim (algo a47): count occurrences of a value in an array using algorim.,Counts occurrences of val in array T.,algorim_a47 | |
| algo_a47_00726,arrays,beginner,copy_array,O(n),O(1),Code the following in Algorim (algo a47): write an array copy function in algorim.,Copies elements from src to dst array.,algorim_a47 | |
| algo_a47_00727,sorting,beginner,bubble_sort,O(n^2),O(1),Code the following in Algorim (algo a47): implement bubble sort in algorim.,Bubble sort with early exit optimization.,algorim_a47 | |
| algo_a47_00728,sorting,beginner,selection_sort,O(n^2),O(1),Code the following in Algorim (algo a47): implement selection sort in algorim.,Selection sort: finds minimum and places it at front.,algorim_a47 | |
| algo_a47_00729,sorting,intermediate,insertion_sort,O(n^2),O(1),Code the following in Algorim (algo a47): implement insertion sort in algorim.,Insertion sort: builds sorted array one element at a time.,algorim_a47 | |
| algo_a47_00730,sorting,advanced,merge_sort,O(n log n),O(n),Code the following in Algorim (algo a47): implement merge sort in algorim.,Merge sort: divide-and-conquer stable sorting algorithm.,algorim_a47 | |
| algo_a47_00731,sorting,advanced,quick_sort,"O(n log n) avg, O(n^2) worst",O(log n),Code the following in Algorim (algo a47): implement quick sort in algorim.,Quick sort with last element as pivot using Lomuto partition.,algorim_a47 | |
| algo_a47_00732,sorting,advanced,heap_sort,O(n log n),O(1),Code the following in Algorim (algo a47): implement heap sort in algorim.,Heap sort using max-heap.,algorim_a47 | |
| algo_a47_00733,linked_list,intermediate,linked_list_basic,"O(1) front, O(n) back",O(1),Code the following in Algorim (algo a47): implement singly linked list insert front and back in algorim.,Singly linked list node creation and insertion operations.,algorim_a47 | |
| algo_a47_00734,linked_list,intermediate,linked_list_delete,O(n),O(1),Code the following in Algorim (algo a47): delete a node with given value from a singly linked list in algorim.,Delete first occurrence of val from linked list.,algorim_a47 | |
| algo_a47_00735,linked_list,intermediate,reverse_linked_list,O(n),O(1),Code the following in Algorim (algo a47): reverse a singly linked list in algorim.,Reverses a singly linked list in-place.,algorim_a47 | |
| algo_a47_00736,linked_list,beginner,list_length,O(n),O(1),Code the following in Algorim (algo a47): find the length of a linked list in algorim.,Returns the length of a singly linked list.,algorim_a47 | |
| algo_a47_00737,data_structures,intermediate,stack,O(1) all ops,O(n),Code the following in Algorim (algo a47): implement a stack data structure in algorim.,"Stack implementation using array with push, pop, peek, isEmpty.",algorim_a47 | |
| algo_a47_00738,data_structures,intermediate,balanced_parentheses,O(n),O(n),Code the following in Algorim (algo a47): check if an expression has balanced parentheses in algorim.,Checks if parentheses/brackets/braces are balanced using a stack.,algorim_a47 | |
| algo_a47_00739,data_structures,intermediate,queue,O(1) all ops,O(n),Code the following in Algorim (algo a47): implement a circular queue in algorim.,"Circular queue implementation with enqueue, dequeue, isEmpty.",algorim_a47 | |
| algo_a47_00740,trees,intermediate,bst_insert,O(h) where h=height,O(h),Code the following in Algorim (algo a47): implement bst insertion in algorim.,Inserts a key into a Binary Search Tree.,algorim_a47 | |
| algo_a47_00741,trees,intermediate,bst_search,O(h),O(h),Code the following in Algorim (algo a47): search for a key in a bst using algorim.,Searches for a key in a Binary Search Tree.,algorim_a47 | |
| algo_a47_00742,trees,beginner,inorder_traversal,O(n),O(h),Code the following in Algorim (algo a47): write in-order traversal of a binary tree in algorim.,In-order traversal of binary tree (Left-Root-Right).,algorim_a47 | |
| algo_a47_00743,trees,beginner,preorder_traversal,O(n),O(h),Code the following in Algorim (algo a47): write pre-order traversal of a binary tree in algorim.,Pre-order traversal (Root-Left-Right).,algorim_a47 | |
| algo_a47_00744,trees,beginner,postorder_traversal,O(n),O(h),Code the following in Algorim (algo a47): write post-order traversal of a binary tree in algorim.,Post-order traversal (Left-Right-Root).,algorim_a47 | |
| algo_a47_00745,trees,intermediate,tree_height,O(n),O(h),Code the following in Algorim (algo a47): find the height of a binary tree in algorim.,Computes the height (depth) of a binary tree.,algorim_a47 | |
| algo_a47_00746,trees,beginner,count_nodes,O(n),O(h),Code the following in Algorim (algo a47): count the number of nodes in a binary tree in algorim.,Counts total nodes in a binary tree.,algorim_a47 | |
| algo_a47_00747,trees,intermediate,level_order_traversal,O(n),O(w) w=max width,Code the following in Algorim (algo a47): implement level-order (bfs) traversal of a binary tree in algorim.,BFS level-order traversal of binary tree using a queue.,algorim_a47 | |
| algo_a47_00748,graphs,advanced,depth_first_search,O(V+E),O(V),Code the following in Algorim (algo a47): implement depth first search (dfs) in algorim.,DFS graph traversal using adjacency matrix and recursion.,algorim_a47 | |
| algo_a47_00749,graphs,advanced,breadth_first_search,O(V+E),O(V),Code the following in Algorim (algo a47): implement breadth first search (bfs) in algorim.,BFS graph traversal using adjacency matrix and queue.,algorim_a47 | |
| algo_a47_00750,strings,beginner,string_length,O(n),O(1),Code the following in Algorim (algo a47): write a string length function in algorim.,Computes string length by counting until null terminator.,algorim_a47 | |
| algo_a47_00751,strings,beginner,palindrome_check,O(n),O(1),Code the following in Algorim (algo a47): check if a string is a palindrome in algorim.,Checks if a string is a palindrome using two pointers.,algorim_a47 | |
| algo_a47_00752,strings,beginner,string_reverse,O(n),O(1),Code the following in Algorim (algo a47): reverse a string in-place in algorim.,Reverses a string in-place.,algorim_a47 | |
| algo_a47_00753,strings,beginner,string_copy,O(n),O(1),Code the following in Algorim (algo a47): copy a string in algorim.,Copies string src to dst.,algorim_a47 | |
| algo_a47_00754,strings,beginner,count_character,O(n),O(1),Code the following in Algorim (algo a47): count occurrences of a character in a string in algorim.,Counts occurrences of character c in string s.,algorim_a47 | |
| algo_a47_00755,dynamic_programming,advanced,longest_common_subsequence,O(m*n),O(m*n),Code the following in Algorim (algo a47): implement lcs algorithm in algorim.,Finds the length of the Longest Common Subsequence using DP.,algorim_a47 | |
| algo_a47_00756,dynamic_programming,advanced,knapsack_0_1,O(n*W),O(n*W),Code the following in Algorim (algo a47): implement the 0/1 knapsack problem in algorim.,0/1 Knapsack problem using bottom-up DP.,algorim_a47 | |
| algo_a47_00757,dynamic_programming,advanced,coin_change,O(amount * n),O(amount),Code the following in Algorim (algo a47): implement coin change problem in algorim.,Minimum number of coins to make an amount (DP).,algorim_a47 | |
| algo_a47_00758,number_theory,intermediate,sieve_eratosthenes,O(n log log n),O(n),Code the following in Algorim (algo a47): implement the sieve of eratosthenes in algorim.,Sieve of Eratosthenes to find all primes up to n.,algorim_a47 | |
| algo_a47_00759,number_theory,beginner,binary_to_decimal,O(n),O(1),Code the following in Algorim (algo a47): convert binary to decimal in algorim.,Converts binary string to decimal integer.,algorim_a47 | |
| algo_a47_00760,data_structures,advanced,hash_table,"O(1) avg, O(n) worst",O(n),Code the following in Algorim (algo a47): implement a hash table with chaining in algorim.,Hash table with separate chaining collision resolution.,algorim_a47 | |
| algo_a47_00761,matrix,intermediate,matrix_multiplication,O(n^3),O(1) extra,Code the following in Algorim (algo a47): implement matrix multiplication in algorim.,"Multiplies two n×n matrices A and B, stores result in C.",algorim_a47 | |
| algo_a47_00762,matrix,beginner,matrix_transpose,O(n^2),O(1),Code the following in Algorim (algo a47): transpose a matrix in-place in algorim.,Transposes a square matrix in-place.,algorim_a47 | |
| algo_a47_00763,data_structures,advanced,min_heap,O(log n) insert/extract,O(n),Code the following in Algorim (algo a47): implement a min-heap in algorim.,Min-heap with insert and extract_min operations.,algorim_a47 | |
| algo_a47_00764,backtracking,advanced,n_queens,O(n!),O(n^2),Code the following in Algorim (algo a47): solve the n-queens problem in algorim.,N-Queens problem using backtracking.,algorim_a47 | |
| algo_a47_00765,commands,beginner,imagine_command,N/A,N/A,Code the following in Algorim (algo a47): how do you ask the model to generate an image of an algorithm?,Command to generate a visual image of an algorithm or code.,algorim_a47 | |
| algo_a47_00766,commands,intermediate,compile_command,N/A,N/A,Code the following in Algorim (algo a47): how do you compile an algorim function to machine code?,Command to compile Algorim code to executable bytecode.,algorim_a47 | |
| algo_a47_00767,commands,intermediate,debug_command,N/A,N/A,Code the following in Algorim (algo a47): how do you debug an algorim function step by step?,Command to debug Algorim code with execution trace.,algorim_a47 | |
| algo_a47_00768,basic,beginner,swap,O(1),O(1),"Using Algorim pseudocode syntax, write write an algorim action to swap two integers.",Exchange values of two integer variables using a temporary variable.,algorim_a47 | |
| algo_a47_00769,math,beginner,absolute_value,O(1),O(1),"Using Algorim pseudocode syntax, write write an algorim function to compute the absolute value.",Returns the absolute value of an integer.,algorim_a47 | |
| algo_a47_00770,math,beginner,power,O(exp),O(1),"Using Algorim pseudocode syntax, write implement a power function in algorim.",Computes base raised to the power of exp using iteration.,algorim_a47 | |
| algo_a47_00771,math,beginner,factorial,O(n),O(1),"Using Algorim pseudocode syntax, write write the factorial function in algorim.",Computes n! iteratively.,algorim_a47 | |
| algo_a47_00772,recursion,intermediate,factorial_recursive,O(n),O(n),"Using Algorim pseudocode syntax, write write a recursive factorial function in algorim.",Recursive factorial computation.,algorim_a47 | |
| algo_a47_00773,math,intermediate,fibonacci,O(n),O(1),"Using Algorim pseudocode syntax, write compute the nth fibonacci number in algorim.",Computes the n-th Fibonacci number iteratively.,algorim_a47 | |
| algo_a47_00774,recursion,intermediate,fibonacci_recursive,O(2^n),O(n),"Using Algorim pseudocode syntax, write write a recursive fibonacci function in algorim.",Recursive Fibonacci using two recursive calls.,algorim_a47 | |
| algo_a47_00775,math,intermediate,gcd,"O(log(min(a,b)))",O(1),"Using Algorim pseudocode syntax, write implement gcd using euclidean algorithm in algorim.",Computes GCD using Euclidean algorithm.,algorim_a47 | |
| algo_a47_00776,math,intermediate,lcm,"O(log(min(a,b)))",O(1),"Using Algorim pseudocode syntax, write write an lcm function in algorim.",Computes LCM using GCD.,algorim_a47 | |
| algo_a47_00777,math,intermediate,primality_test,O(sqrt(n)),O(1),"Using Algorim pseudocode syntax, write write a primality test in algorim.",Checks if a number is prime using trial division up to sqrt(n).,algorim_a47 | |
| algo_a47_00778,arrays,beginner,array_sum,O(n),O(1),"Using Algorim pseudocode syntax, write sum all elements of an array in algorim.",Sums all elements of an integer array.,algorim_a47 | |
| algo_a47_00779,arrays,beginner,find_maximum,O(n),O(1),"Using Algorim pseudocode syntax, write find the maximum element in an array using algorim.",Finds the maximum element in an array.,algorim_a47 | |
| algo_a47_00780,arrays,beginner,find_minimum,O(n),O(1),"Using Algorim pseudocode syntax, write find the minimum element in an array using algorim.",Finds the minimum element in an array.,algorim_a47 | |
| algo_a47_00781,searching,beginner,linear_search,O(n),O(1),"Using Algorim pseudocode syntax, write implement linear search in algorim.","Searches for target in array, returns index or -1.",algorim_a47 | |
| algo_a47_00782,searching,intermediate,binary_search,O(log n),O(1),"Using Algorim pseudocode syntax, write write binary search in algorim for a sorted array.",Binary search on sorted array. Returns index or -1.,algorim_a47 | |
| algo_a47_00783,arrays,beginner,reverse_array,O(n),O(1),"Using Algorim pseudocode syntax, write reverse an array in-place in algorim.",Reverses an array in-place using two pointers.,algorim_a47 | |
| algo_a47_00784,arrays,beginner,count_occurrences,O(n),O(1),"Using Algorim pseudocode syntax, write count occurrences of a value in an array using algorim.",Counts occurrences of val in array T.,algorim_a47 | |
| algo_a47_00785,arrays,beginner,copy_array,O(n),O(1),"Using Algorim pseudocode syntax, write write an array copy function in algorim.",Copies elements from src to dst array.,algorim_a47 | |
| algo_a47_00786,sorting,beginner,bubble_sort,O(n^2),O(1),"Using Algorim pseudocode syntax, write implement bubble sort in algorim.",Bubble sort with early exit optimization.,algorim_a47 | |
| algo_a47_00787,sorting,beginner,selection_sort,O(n^2),O(1),"Using Algorim pseudocode syntax, write implement selection sort in algorim.",Selection sort: finds minimum and places it at front.,algorim_a47 | |
| algo_a47_00788,sorting,intermediate,insertion_sort,O(n^2),O(1),"Using Algorim pseudocode syntax, write implement insertion sort in algorim.",Insertion sort: builds sorted array one element at a time.,algorim_a47 | |
| algo_a47_00789,sorting,advanced,merge_sort,O(n log n),O(n),"Using Algorim pseudocode syntax, write implement merge sort in algorim.",Merge sort: divide-and-conquer stable sorting algorithm.,algorim_a47 | |
| algo_a47_00790,sorting,advanced,quick_sort,"O(n log n) avg, O(n^2) worst",O(log n),"Using Algorim pseudocode syntax, write implement quick sort in algorim.",Quick sort with last element as pivot using Lomuto partition.,algorim_a47 | |
| algo_a47_00791,sorting,advanced,heap_sort,O(n log n),O(1),"Using Algorim pseudocode syntax, write implement heap sort in algorim.",Heap sort using max-heap.,algorim_a47 | |
| algo_a47_00792,linked_list,intermediate,linked_list_basic,"O(1) front, O(n) back",O(1),"Using Algorim pseudocode syntax, write implement singly linked list insert front and back in algorim.",Singly linked list node creation and insertion operations.,algorim_a47 | |
| algo_a47_00793,linked_list,intermediate,linked_list_delete,O(n),O(1),"Using Algorim pseudocode syntax, write delete a node with given value from a singly linked list in algorim.",Delete first occurrence of val from linked list.,algorim_a47 | |
| algo_a47_00794,linked_list,intermediate,reverse_linked_list,O(n),O(1),"Using Algorim pseudocode syntax, write reverse a singly linked list in algorim.",Reverses a singly linked list in-place.,algorim_a47 | |
| algo_a47_00795,linked_list,beginner,list_length,O(n),O(1),"Using Algorim pseudocode syntax, write find the length of a linked list in algorim.",Returns the length of a singly linked list.,algorim_a47 | |
| algo_a47_00796,data_structures,intermediate,stack,O(1) all ops,O(n),"Using Algorim pseudocode syntax, write implement a stack data structure in algorim.","Stack implementation using array with push, pop, peek, isEmpty.",algorim_a47 | |
| algo_a47_00797,data_structures,intermediate,balanced_parentheses,O(n),O(n),"Using Algorim pseudocode syntax, write check if an expression has balanced parentheses in algorim.",Checks if parentheses/brackets/braces are balanced using a stack.,algorim_a47 | |
| algo_a47_00798,data_structures,intermediate,queue,O(1) all ops,O(n),"Using Algorim pseudocode syntax, write implement a circular queue in algorim.","Circular queue implementation with enqueue, dequeue, isEmpty.",algorim_a47 | |
| algo_a47_00799,trees,intermediate,bst_insert,O(h) where h=height,O(h),"Using Algorim pseudocode syntax, write implement bst insertion in algorim.",Inserts a key into a Binary Search Tree.,algorim_a47 | |
| algo_a47_00800,trees,intermediate,bst_search,O(h),O(h),"Using Algorim pseudocode syntax, write search for a key in a bst using algorim.",Searches for a key in a Binary Search Tree.,algorim_a47 | |
| algo_a47_00801,trees,beginner,inorder_traversal,O(n),O(h),"Using Algorim pseudocode syntax, write write in-order traversal of a binary tree in algorim.",In-order traversal of binary tree (Left-Root-Right).,algorim_a47 | |
| algo_a47_00802,trees,beginner,preorder_traversal,O(n),O(h),"Using Algorim pseudocode syntax, write write pre-order traversal of a binary tree in algorim.",Pre-order traversal (Root-Left-Right).,algorim_a47 | |
| algo_a47_00803,trees,beginner,postorder_traversal,O(n),O(h),"Using Algorim pseudocode syntax, write write post-order traversal of a binary tree in algorim.",Post-order traversal (Left-Right-Root).,algorim_a47 | |
| algo_a47_00804,trees,intermediate,tree_height,O(n),O(h),"Using Algorim pseudocode syntax, write find the height of a binary tree in algorim.",Computes the height (depth) of a binary tree.,algorim_a47 | |
| algo_a47_00805,trees,beginner,count_nodes,O(n),O(h),"Using Algorim pseudocode syntax, write count the number of nodes in a binary tree in algorim.",Counts total nodes in a binary tree.,algorim_a47 | |
| algo_a47_00806,trees,intermediate,level_order_traversal,O(n),O(w) w=max width,"Using Algorim pseudocode syntax, write implement level-order (bfs) traversal of a binary tree in algorim.",BFS level-order traversal of binary tree using a queue.,algorim_a47 | |
| algo_a47_00807,graphs,advanced,depth_first_search,O(V+E),O(V),"Using Algorim pseudocode syntax, write implement depth first search (dfs) in algorim.",DFS graph traversal using adjacency matrix and recursion.,algorim_a47 | |
| algo_a47_00808,graphs,advanced,breadth_first_search,O(V+E),O(V),"Using Algorim pseudocode syntax, write implement breadth first search (bfs) in algorim.",BFS graph traversal using adjacency matrix and queue.,algorim_a47 | |
| algo_a47_00809,strings,beginner,string_length,O(n),O(1),"Using Algorim pseudocode syntax, write write a string length function in algorim.",Computes string length by counting until null terminator.,algorim_a47 | |
| algo_a47_00810,strings,beginner,palindrome_check,O(n),O(1),"Using Algorim pseudocode syntax, write check if a string is a palindrome in algorim.",Checks if a string is a palindrome using two pointers.,algorim_a47 | |
| algo_a47_00811,strings,beginner,string_reverse,O(n),O(1),"Using Algorim pseudocode syntax, write reverse a string in-place in algorim.",Reverses a string in-place.,algorim_a47 | |
| algo_a47_00812,strings,beginner,string_copy,O(n),O(1),"Using Algorim pseudocode syntax, write copy a string in algorim.",Copies string src to dst.,algorim_a47 | |
| algo_a47_00813,strings,beginner,count_character,O(n),O(1),"Using Algorim pseudocode syntax, write count occurrences of a character in a string in algorim.",Counts occurrences of character c in string s.,algorim_a47 | |
| algo_a47_00814,dynamic_programming,advanced,longest_common_subsequence,O(m*n),O(m*n),"Using Algorim pseudocode syntax, write implement lcs algorithm in algorim.",Finds the length of the Longest Common Subsequence using DP.,algorim_a47 | |
| algo_a47_00815,dynamic_programming,advanced,knapsack_0_1,O(n*W),O(n*W),"Using Algorim pseudocode syntax, write implement the 0/1 knapsack problem in algorim.",0/1 Knapsack problem using bottom-up DP.,algorim_a47 | |
| algo_a47_00816,dynamic_programming,advanced,coin_change,O(amount * n),O(amount),"Using Algorim pseudocode syntax, write implement coin change problem in algorim.",Minimum number of coins to make an amount (DP).,algorim_a47 | |
| algo_a47_00817,number_theory,intermediate,sieve_eratosthenes,O(n log log n),O(n),"Using Algorim pseudocode syntax, write implement the sieve of eratosthenes in algorim.",Sieve of Eratosthenes to find all primes up to n.,algorim_a47 | |
| algo_a47_00818,number_theory,beginner,binary_to_decimal,O(n),O(1),"Using Algorim pseudocode syntax, write convert binary to decimal in algorim.",Converts binary string to decimal integer.,algorim_a47 | |
| algo_a47_00819,data_structures,advanced,hash_table,"O(1) avg, O(n) worst",O(n),"Using Algorim pseudocode syntax, write implement a hash table with chaining in algorim.",Hash table with separate chaining collision resolution.,algorim_a47 | |
| algo_a47_00820,matrix,intermediate,matrix_multiplication,O(n^3),O(1) extra,"Using Algorim pseudocode syntax, write implement matrix multiplication in algorim.","Multiplies two n×n matrices A and B, stores result in C.",algorim_a47 | |
| algo_a47_00821,matrix,beginner,matrix_transpose,O(n^2),O(1),"Using Algorim pseudocode syntax, write transpose a matrix in-place in algorim.",Transposes a square matrix in-place.,algorim_a47 | |
| algo_a47_00822,data_structures,advanced,min_heap,O(log n) insert/extract,O(n),"Using Algorim pseudocode syntax, write implement a min-heap in algorim.",Min-heap with insert and extract_min operations.,algorim_a47 | |
| algo_a47_00823,backtracking,advanced,n_queens,O(n!),O(n^2),"Using Algorim pseudocode syntax, write solve the n-queens problem in algorim.",N-Queens problem using backtracking.,algorim_a47 | |
| algo_a47_00824,commands,beginner,imagine_command,N/A,N/A,"Using Algorim pseudocode syntax, write how do you ask the model to generate an image of an algorithm?",Command to generate a visual image of an algorithm or code.,algorim_a47 | |
| algo_a47_00825,commands,intermediate,compile_command,N/A,N/A,"Using Algorim pseudocode syntax, write how do you compile an algorim function to machine code?",Command to compile Algorim code to executable bytecode.,algorim_a47 | |
| algo_a47_00826,commands,intermediate,debug_command,N/A,N/A,"Using Algorim pseudocode syntax, write how do you debug an algorim function step by step?",Command to debug Algorim code with execution trace.,algorim_a47 | |
| algo_a47_00827,basic,beginner,swap,O(1),O(1),"في لغة Algorim, اكتب خوارزمية write an algorim action to swap two integers.",Exchange values of two integer variables using a temporary variable.,algorim_a47 | |
| algo_a47_00828,math,beginner,absolute_value,O(1),O(1),"في لغة Algorim, اكتب خوارزمية write an algorim function to compute the absolute value.",Returns the absolute value of an integer.,algorim_a47 | |
| algo_a47_00829,math,beginner,power,O(exp),O(1),"في لغة Algorim, اكتب خوارزمية implement a power function in algorim.",Computes base raised to the power of exp using iteration.,algorim_a47 | |
| algo_a47_00830,math,beginner,factorial,O(n),O(1),"في لغة Algorim, اكتب خوارزمية write the factorial function in algorim.",Computes n! iteratively.,algorim_a47 | |
| algo_a47_00831,recursion,intermediate,factorial_recursive,O(n),O(n),"في لغة Algorim, اكتب خوارزمية write a recursive factorial function in algorim.",Recursive factorial computation.,algorim_a47 | |
| algo_a47_00832,math,intermediate,fibonacci,O(n),O(1),"في لغة Algorim, اكتب خوارزمية compute the nth fibonacci number in algorim.",Computes the n-th Fibonacci number iteratively.,algorim_a47 | |
| algo_a47_00833,recursion,intermediate,fibonacci_recursive,O(2^n),O(n),"في لغة Algorim, اكتب خوارزمية write a recursive fibonacci function in algorim.",Recursive Fibonacci using two recursive calls.,algorim_a47 | |
| algo_a47_00834,math,intermediate,gcd,"O(log(min(a,b)))",O(1),"في لغة Algorim, اكتب خوارزمية implement gcd using euclidean algorithm in algorim.",Computes GCD using Euclidean algorithm.,algorim_a47 | |
| algo_a47_00835,math,intermediate,lcm,"O(log(min(a,b)))",O(1),"في لغة Algorim, اكتب خوارزمية write an lcm function in algorim.",Computes LCM using GCD.,algorim_a47 | |
| algo_a47_00836,math,intermediate,primality_test,O(sqrt(n)),O(1),"في لغة Algorim, اكتب خوارزمية write a primality test in algorim.",Checks if a number is prime using trial division up to sqrt(n).,algorim_a47 | |
| algo_a47_00837,arrays,beginner,array_sum,O(n),O(1),"في لغة Algorim, اكتب خوارزمية sum all elements of an array in algorim.",Sums all elements of an integer array.,algorim_a47 | |
| algo_a47_00838,arrays,beginner,find_maximum,O(n),O(1),"في لغة Algorim, اكتب خوارزمية find the maximum element in an array using algorim.",Finds the maximum element in an array.,algorim_a47 | |
| algo_a47_00839,arrays,beginner,find_minimum,O(n),O(1),"في لغة Algorim, اكتب خوارزمية find the minimum element in an array using algorim.",Finds the minimum element in an array.,algorim_a47 | |
| algo_a47_00840,searching,beginner,linear_search,O(n),O(1),"في لغة Algorim, اكتب خوارزمية implement linear search in algorim.","Searches for target in array, returns index or -1.",algorim_a47 | |
| algo_a47_00841,searching,intermediate,binary_search,O(log n),O(1),"في لغة Algorim, اكتب خوارزمية write binary search in algorim for a sorted array.",Binary search on sorted array. Returns index or -1.,algorim_a47 | |
| algo_a47_00842,arrays,beginner,reverse_array,O(n),O(1),"في لغة Algorim, اكتب خوارزمية reverse an array in-place in algorim.",Reverses an array in-place using two pointers.,algorim_a47 | |
| algo_a47_00843,arrays,beginner,count_occurrences,O(n),O(1),"في لغة Algorim, اكتب خوارزمية count occurrences of a value in an array using algorim.",Counts occurrences of val in array T.,algorim_a47 | |
| algo_a47_00844,arrays,beginner,copy_array,O(n),O(1),"في لغة Algorim, اكتب خوارزمية write an array copy function in algorim.",Copies elements from src to dst array.,algorim_a47 | |
| algo_a47_00845,sorting,beginner,bubble_sort,O(n^2),O(1),"في لغة Algorim, اكتب خوارزمية implement bubble sort in algorim.",Bubble sort with early exit optimization.,algorim_a47 | |
| algo_a47_00846,sorting,beginner,selection_sort,O(n^2),O(1),"في لغة Algorim, اكتب خوارزمية implement selection sort in algorim.",Selection sort: finds minimum and places it at front.,algorim_a47 | |
| algo_a47_00847,sorting,intermediate,insertion_sort,O(n^2),O(1),"في لغة Algorim, اكتب خوارزمية implement insertion sort in algorim.",Insertion sort: builds sorted array one element at a time.,algorim_a47 | |
| algo_a47_00848,sorting,advanced,merge_sort,O(n log n),O(n),"في لغة Algorim, اكتب خوارزمية implement merge sort in algorim.",Merge sort: divide-and-conquer stable sorting algorithm.,algorim_a47 | |
| algo_a47_00849,sorting,advanced,quick_sort,"O(n log n) avg, O(n^2) worst",O(log n),"في لغة Algorim, اكتب خوارزمية implement quick sort in algorim.",Quick sort with last element as pivot using Lomuto partition.,algorim_a47 | |
| algo_a47_00850,sorting,advanced,heap_sort,O(n log n),O(1),"في لغة Algorim, اكتب خوارزمية implement heap sort in algorim.",Heap sort using max-heap.,algorim_a47 | |
| algo_a47_00851,linked_list,intermediate,linked_list_basic,"O(1) front, O(n) back",O(1),"في لغة Algorim, اكتب خوارزمية implement singly linked list insert front and back in algorim.",Singly linked list node creation and insertion operations.,algorim_a47 | |
| algo_a47_00852,linked_list,intermediate,linked_list_delete,O(n),O(1),"في لغة Algorim, اكتب خوارزمية delete a node with given value from a singly linked list in algorim.",Delete first occurrence of val from linked list.,algorim_a47 | |
| algo_a47_00853,linked_list,intermediate,reverse_linked_list,O(n),O(1),"في لغة Algorim, اكتب خوارزمية reverse a singly linked list in algorim.",Reverses a singly linked list in-place.,algorim_a47 | |
| algo_a47_00854,linked_list,beginner,list_length,O(n),O(1),"في لغة Algorim, اكتب خوارزمية find the length of a linked list in algorim.",Returns the length of a singly linked list.,algorim_a47 | |
| algo_a47_00855,data_structures,intermediate,stack,O(1) all ops,O(n),"في لغة Algorim, اكتب خوارزمية implement a stack data structure in algorim.","Stack implementation using array with push, pop, peek, isEmpty.",algorim_a47 | |
| algo_a47_00856,data_structures,intermediate,balanced_parentheses,O(n),O(n),"في لغة Algorim, اكتب خوارزمية check if an expression has balanced parentheses in algorim.",Checks if parentheses/brackets/braces are balanced using a stack.,algorim_a47 | |
| algo_a47_00857,data_structures,intermediate,queue,O(1) all ops,O(n),"في لغة Algorim, اكتب خوارزمية implement a circular queue in algorim.","Circular queue implementation with enqueue, dequeue, isEmpty.",algorim_a47 | |
| algo_a47_00858,trees,intermediate,bst_insert,O(h) where h=height,O(h),"في لغة Algorim, اكتب خوارزمية implement bst insertion in algorim.",Inserts a key into a Binary Search Tree.,algorim_a47 | |
| algo_a47_00859,trees,intermediate,bst_search,O(h),O(h),"في لغة Algorim, اكتب خوارزمية search for a key in a bst using algorim.",Searches for a key in a Binary Search Tree.,algorim_a47 | |
| algo_a47_00860,trees,beginner,inorder_traversal,O(n),O(h),"في لغة Algorim, اكتب خوارزمية write in-order traversal of a binary tree in algorim.",In-order traversal of binary tree (Left-Root-Right).,algorim_a47 | |
| algo_a47_00861,trees,beginner,preorder_traversal,O(n),O(h),"في لغة Algorim, اكتب خوارزمية write pre-order traversal of a binary tree in algorim.",Pre-order traversal (Root-Left-Right).,algorim_a47 | |
| algo_a47_00862,trees,beginner,postorder_traversal,O(n),O(h),"في لغة Algorim, اكتب خوارزمية write post-order traversal of a binary tree in algorim.",Post-order traversal (Left-Right-Root).,algorim_a47 | |
| algo_a47_00863,trees,intermediate,tree_height,O(n),O(h),"في لغة Algorim, اكتب خوارزمية find the height of a binary tree in algorim.",Computes the height (depth) of a binary tree.,algorim_a47 | |
| algo_a47_00864,trees,beginner,count_nodes,O(n),O(h),"في لغة Algorim, اكتب خوارزمية count the number of nodes in a binary tree in algorim.",Counts total nodes in a binary tree.,algorim_a47 | |
| algo_a47_00865,trees,intermediate,level_order_traversal,O(n),O(w) w=max width,"في لغة Algorim, اكتب خوارزمية implement level-order (bfs) traversal of a binary tree in algorim.",BFS level-order traversal of binary tree using a queue.,algorim_a47 | |
| algo_a47_00866,graphs,advanced,depth_first_search,O(V+E),O(V),"في لغة Algorim, اكتب خوارزمية implement depth first search (dfs) in algorim.",DFS graph traversal using adjacency matrix and recursion.,algorim_a47 | |
| algo_a47_00867,graphs,advanced,breadth_first_search,O(V+E),O(V),"في لغة Algorim, اكتب خوارزمية implement breadth first search (bfs) in algorim.",BFS graph traversal using adjacency matrix and queue.,algorim_a47 | |
| algo_a47_00868,strings,beginner,string_length,O(n),O(1),"في لغة Algorim, اكتب خوارزمية write a string length function in algorim.",Computes string length by counting until null terminator.,algorim_a47 | |
| algo_a47_00869,strings,beginner,palindrome_check,O(n),O(1),"في لغة Algorim, اكتب خوارزمية check if a string is a palindrome in algorim.",Checks if a string is a palindrome using two pointers.,algorim_a47 | |
| algo_a47_00870,strings,beginner,string_reverse,O(n),O(1),"في لغة Algorim, اكتب خوارزمية reverse a string in-place in algorim.",Reverses a string in-place.,algorim_a47 | |
| algo_a47_00871,strings,beginner,string_copy,O(n),O(1),"في لغة Algorim, اكتب خوارزمية copy a string in algorim.",Copies string src to dst.,algorim_a47 | |
| algo_a47_00872,strings,beginner,count_character,O(n),O(1),"في لغة Algorim, اكتب خوارزمية count occurrences of a character in a string in algorim.",Counts occurrences of character c in string s.,algorim_a47 | |
| algo_a47_00873,dynamic_programming,advanced,longest_common_subsequence,O(m*n),O(m*n),"في لغة Algorim, اكتب خوارزمية implement lcs algorithm in algorim.",Finds the length of the Longest Common Subsequence using DP.,algorim_a47 | |
| algo_a47_00874,dynamic_programming,advanced,knapsack_0_1,O(n*W),O(n*W),"في لغة Algorim, اكتب خوارزمية implement the 0/1 knapsack problem in algorim.",0/1 Knapsack problem using bottom-up DP.,algorim_a47 | |
| algo_a47_00875,dynamic_programming,advanced,coin_change,O(amount * n),O(amount),"في لغة Algorim, اكتب خوارزمية implement coin change problem in algorim.",Minimum number of coins to make an amount (DP).,algorim_a47 | |
| algo_a47_00876,number_theory,intermediate,sieve_eratosthenes,O(n log log n),O(n),"في لغة Algorim, اكتب خوارزمية implement the sieve of eratosthenes in algorim.",Sieve of Eratosthenes to find all primes up to n.,algorim_a47 | |
| algo_a47_00877,number_theory,beginner,binary_to_decimal,O(n),O(1),"في لغة Algorim, اكتب خوارزمية convert binary to decimal in algorim.",Converts binary string to decimal integer.,algorim_a47 | |
| algo_a47_00878,data_structures,advanced,hash_table,"O(1) avg, O(n) worst",O(n),"في لغة Algorim, اكتب خوارزمية implement a hash table with chaining in algorim.",Hash table with separate chaining collision resolution.,algorim_a47 | |
| algo_a47_00879,matrix,intermediate,matrix_multiplication,O(n^3),O(1) extra,"في لغة Algorim, اكتب خوارزمية implement matrix multiplication in algorim.","Multiplies two n×n matrices A and B, stores result in C.",algorim_a47 | |
| algo_a47_00880,matrix,beginner,matrix_transpose,O(n^2),O(1),"في لغة Algorim, اكتب خوارزمية transpose a matrix in-place in algorim.",Transposes a square matrix in-place.,algorim_a47 | |
| algo_a47_00881,data_structures,advanced,min_heap,O(log n) insert/extract,O(n),"في لغة Algorim, اكتب خوارزمية implement a min-heap in algorim.",Min-heap with insert and extract_min operations.,algorim_a47 | |
| algo_a47_00882,backtracking,advanced,n_queens,O(n!),O(n^2),"في لغة Algorim, اكتب خوارزمية solve the n-queens problem in algorim.",N-Queens problem using backtracking.,algorim_a47 | |
| algo_a47_00883,commands,beginner,imagine_command,N/A,N/A,"في لغة Algorim, اكتب خوارزمية how do you ask the model to generate an image of an algorithm?",Command to generate a visual image of an algorithm or code.,algorim_a47 | |
| algo_a47_00884,commands,intermediate,compile_command,N/A,N/A,"في لغة Algorim, اكتب خوارزمية how do you compile an algorim function to machine code?",Command to compile Algorim code to executable bytecode.,algorim_a47 | |
| algo_a47_00885,commands,intermediate,debug_command,N/A,N/A,"في لغة Algorim, اكتب خوارزمية how do you debug an algorim function step by step?",Command to debug Algorim code with execution trace.,algorim_a47 | |
| algo_a47_00886,basic,beginner,swap,O(1),O(1),أكمل الكود التالي في Algorim: write an algorim action to swap two integers.,Exchange values of two integer variables using a temporary variable.,algorim_a47 | |
| algo_a47_00887,math,beginner,absolute_value,O(1),O(1),أكمل الكود التالي في Algorim: write an algorim function to compute the absolute value.,Returns the absolute value of an integer.,algorim_a47 | |
| algo_a47_00888,math,beginner,power,O(exp),O(1),أكمل الكود التالي في Algorim: implement a power function in algorim.,Computes base raised to the power of exp using iteration.,algorim_a47 | |
| algo_a47_00889,math,beginner,factorial,O(n),O(1),أكمل الكود التالي في Algorim: write the factorial function in algorim.,Computes n! iteratively.,algorim_a47 | |
| algo_a47_00890,recursion,intermediate,factorial_recursive,O(n),O(n),أكمل الكود التالي في Algorim: write a recursive factorial function in algorim.,Recursive factorial computation.,algorim_a47 | |
| algo_a47_00891,math,intermediate,fibonacci,O(n),O(1),أكمل الكود التالي في Algorim: compute the nth fibonacci number in algorim.,Computes the n-th Fibonacci number iteratively.,algorim_a47 | |
| algo_a47_00892,recursion,intermediate,fibonacci_recursive,O(2^n),O(n),أكمل الكود التالي في Algorim: write a recursive fibonacci function in algorim.,Recursive Fibonacci using two recursive calls.,algorim_a47 | |
| algo_a47_00893,math,intermediate,gcd,"O(log(min(a,b)))",O(1),أكمل الكود التالي في Algorim: implement gcd using euclidean algorithm in algorim.,Computes GCD using Euclidean algorithm.,algorim_a47 | |
| algo_a47_00894,math,intermediate,lcm,"O(log(min(a,b)))",O(1),أكمل الكود التالي في Algorim: write an lcm function in algorim.,Computes LCM using GCD.,algorim_a47 | |
| algo_a47_00895,math,intermediate,primality_test,O(sqrt(n)),O(1),أكمل الكود التالي في Algorim: write a primality test in algorim.,Checks if a number is prime using trial division up to sqrt(n).,algorim_a47 | |
| algo_a47_00896,arrays,beginner,array_sum,O(n),O(1),أكمل الكود التالي في Algorim: sum all elements of an array in algorim.,Sums all elements of an integer array.,algorim_a47 | |
| algo_a47_00897,arrays,beginner,find_maximum,O(n),O(1),أكمل الكود التالي في Algorim: find the maximum element in an array using algorim.,Finds the maximum element in an array.,algorim_a47 | |
| algo_a47_00898,arrays,beginner,find_minimum,O(n),O(1),أكمل الكود التالي في Algorim: find the minimum element in an array using algorim.,Finds the minimum element in an array.,algorim_a47 | |
| algo_a47_00899,searching,beginner,linear_search,O(n),O(1),أكمل الكود التالي في Algorim: implement linear search in algorim.,"Searches for target in array, returns index or -1.",algorim_a47 | |
| algo_a47_00900,searching,intermediate,binary_search,O(log n),O(1),أكمل الكود التالي في Algorim: write binary search in algorim for a sorted array.,Binary search on sorted array. Returns index or -1.,algorim_a47 | |
| algo_a47_00901,arrays,beginner,reverse_array,O(n),O(1),أكمل الكود التالي في Algorim: reverse an array in-place in algorim.,Reverses an array in-place using two pointers.,algorim_a47 | |
| algo_a47_00902,arrays,beginner,count_occurrences,O(n),O(1),أكمل الكود التالي في Algorim: count occurrences of a value in an array using algorim.,Counts occurrences of val in array T.,algorim_a47 | |
| algo_a47_00903,arrays,beginner,copy_array,O(n),O(1),أكمل الكود التالي في Algorim: write an array copy function in algorim.,Copies elements from src to dst array.,algorim_a47 | |
| algo_a47_00904,sorting,beginner,bubble_sort,O(n^2),O(1),أكمل الكود التالي في Algorim: implement bubble sort in algorim.,Bubble sort with early exit optimization.,algorim_a47 | |
| algo_a47_00905,sorting,beginner,selection_sort,O(n^2),O(1),أكمل الكود التالي في Algorim: implement selection sort in algorim.,Selection sort: finds minimum and places it at front.,algorim_a47 | |
| algo_a47_00906,sorting,intermediate,insertion_sort,O(n^2),O(1),أكمل الكود التالي في Algorim: implement insertion sort in algorim.,Insertion sort: builds sorted array one element at a time.,algorim_a47 | |
| algo_a47_00907,sorting,advanced,merge_sort,O(n log n),O(n),أكمل الكود التالي في Algorim: implement merge sort in algorim.,Merge sort: divide-and-conquer stable sorting algorithm.,algorim_a47 | |
| algo_a47_00908,sorting,advanced,quick_sort,"O(n log n) avg, O(n^2) worst",O(log n),أكمل الكود التالي في Algorim: implement quick sort in algorim.,Quick sort with last element as pivot using Lomuto partition.,algorim_a47 | |
| algo_a47_00909,sorting,advanced,heap_sort,O(n log n),O(1),أكمل الكود التالي في Algorim: implement heap sort in algorim.,Heap sort using max-heap.,algorim_a47 | |
| algo_a47_00910,linked_list,intermediate,linked_list_basic,"O(1) front, O(n) back",O(1),أكمل الكود التالي في Algorim: implement singly linked list insert front and back in algorim.,Singly linked list node creation and insertion operations.,algorim_a47 | |
| algo_a47_00911,linked_list,intermediate,linked_list_delete,O(n),O(1),أكمل الكود التالي في Algorim: delete a node with given value from a singly linked list in algorim.,Delete first occurrence of val from linked list.,algorim_a47 | |
| algo_a47_00912,linked_list,intermediate,reverse_linked_list,O(n),O(1),أكمل الكود التالي في Algorim: reverse a singly linked list in algorim.,Reverses a singly linked list in-place.,algorim_a47 | |
| algo_a47_00913,linked_list,beginner,list_length,O(n),O(1),أكمل الكود التالي في Algorim: find the length of a linked list in algorim.,Returns the length of a singly linked list.,algorim_a47 | |
| algo_a47_00914,data_structures,intermediate,stack,O(1) all ops,O(n),أكمل الكود التالي في Algorim: implement a stack data structure in algorim.,"Stack implementation using array with push, pop, peek, isEmpty.",algorim_a47 | |
| algo_a47_00915,data_structures,intermediate,balanced_parentheses,O(n),O(n),أكمل الكود التالي في Algorim: check if an expression has balanced parentheses in algorim.,Checks if parentheses/brackets/braces are balanced using a stack.,algorim_a47 | |
| algo_a47_00916,data_structures,intermediate,queue,O(1) all ops,O(n),أكمل الكود التالي في Algorim: implement a circular queue in algorim.,"Circular queue implementation with enqueue, dequeue, isEmpty.",algorim_a47 | |
| algo_a47_00917,trees,intermediate,bst_insert,O(h) where h=height,O(h),أكمل الكود التالي في Algorim: implement bst insertion in algorim.,Inserts a key into a Binary Search Tree.,algorim_a47 | |
| algo_a47_00918,trees,intermediate,bst_search,O(h),O(h),أكمل الكود التالي في Algorim: search for a key in a bst using algorim.,Searches for a key in a Binary Search Tree.,algorim_a47 | |
| algo_a47_00919,trees,beginner,inorder_traversal,O(n),O(h),أكمل الكود التالي في Algorim: write in-order traversal of a binary tree in algorim.,In-order traversal of binary tree (Left-Root-Right).,algorim_a47 | |
| algo_a47_00920,trees,beginner,preorder_traversal,O(n),O(h),أكمل الكود التالي في Algorim: write pre-order traversal of a binary tree in algorim.,Pre-order traversal (Root-Left-Right).,algorim_a47 | |
| algo_a47_00921,trees,beginner,postorder_traversal,O(n),O(h),أكمل الكود التالي في Algorim: write post-order traversal of a binary tree in algorim.,Post-order traversal (Left-Right-Root).,algorim_a47 | |
| algo_a47_00922,trees,intermediate,tree_height,O(n),O(h),أكمل الكود التالي في Algorim: find the height of a binary tree in algorim.,Computes the height (depth) of a binary tree.,algorim_a47 | |
| algo_a47_00923,trees,beginner,count_nodes,O(n),O(h),أكمل الكود التالي في Algorim: count the number of nodes in a binary tree in algorim.,Counts total nodes in a binary tree.,algorim_a47 | |
| algo_a47_00924,trees,intermediate,level_order_traversal,O(n),O(w) w=max width,أكمل الكود التالي في Algorim: implement level-order (bfs) traversal of a binary tree in algorim.,BFS level-order traversal of binary tree using a queue.,algorim_a47 | |
| algo_a47_00925,graphs,advanced,depth_first_search,O(V+E),O(V),أكمل الكود التالي في Algorim: implement depth first search (dfs) in algorim.,DFS graph traversal using adjacency matrix and recursion.,algorim_a47 | |
| algo_a47_00926,graphs,advanced,breadth_first_search,O(V+E),O(V),أكمل الكود التالي في Algorim: implement breadth first search (bfs) in algorim.,BFS graph traversal using adjacency matrix and queue.,algorim_a47 | |
| algo_a47_00927,strings,beginner,string_length,O(n),O(1),أكمل الكود التالي في Algorim: write a string length function in algorim.,Computes string length by counting until null terminator.,algorim_a47 | |
| algo_a47_00928,strings,beginner,palindrome_check,O(n),O(1),أكمل الكود التالي في Algorim: check if a string is a palindrome in algorim.,Checks if a string is a palindrome using two pointers.,algorim_a47 | |
| algo_a47_00929,strings,beginner,string_reverse,O(n),O(1),أكمل الكود التالي في Algorim: reverse a string in-place in algorim.,Reverses a string in-place.,algorim_a47 | |
| algo_a47_00930,strings,beginner,string_copy,O(n),O(1),أكمل الكود التالي في Algorim: copy a string in algorim.,Copies string src to dst.,algorim_a47 | |
| algo_a47_00931,strings,beginner,count_character,O(n),O(1),أكمل الكود التالي في Algorim: count occurrences of a character in a string in algorim.,Counts occurrences of character c in string s.,algorim_a47 | |
| algo_a47_00932,dynamic_programming,advanced,longest_common_subsequence,O(m*n),O(m*n),أكمل الكود التالي في Algorim: implement lcs algorithm in algorim.,Finds the length of the Longest Common Subsequence using DP.,algorim_a47 | |
| algo_a47_00933,dynamic_programming,advanced,knapsack_0_1,O(n*W),O(n*W),أكمل الكود التالي في Algorim: implement the 0/1 knapsack problem in algorim.,0/1 Knapsack problem using bottom-up DP.,algorim_a47 | |
| algo_a47_00934,dynamic_programming,advanced,coin_change,O(amount * n),O(amount),أكمل الكود التالي في Algorim: implement coin change problem in algorim.,Minimum number of coins to make an amount (DP).,algorim_a47 | |
| algo_a47_00935,number_theory,intermediate,sieve_eratosthenes,O(n log log n),O(n),أكمل الكود التالي في Algorim: implement the sieve of eratosthenes in algorim.,Sieve of Eratosthenes to find all primes up to n.,algorim_a47 | |
| algo_a47_00936,number_theory,beginner,binary_to_decimal,O(n),O(1),أكمل الكود التالي في Algorim: convert binary to decimal in algorim.,Converts binary string to decimal integer.,algorim_a47 | |
| algo_a47_00937,data_structures,advanced,hash_table,"O(1) avg, O(n) worst",O(n),أكمل الكود التالي في Algorim: implement a hash table with chaining in algorim.,Hash table with separate chaining collision resolution.,algorim_a47 | |
| algo_a47_00938,matrix,intermediate,matrix_multiplication,O(n^3),O(1) extra,أكمل الكود التالي في Algorim: implement matrix multiplication in algorim.,"Multiplies two n×n matrices A and B, stores result in C.",algorim_a47 | |
| algo_a47_00939,matrix,beginner,matrix_transpose,O(n^2),O(1),أكمل الكود التالي في Algorim: transpose a matrix in-place in algorim.,Transposes a square matrix in-place.,algorim_a47 | |
| algo_a47_00940,data_structures,advanced,min_heap,O(log n) insert/extract,O(n),أكمل الكود التالي في Algorim: implement a min-heap in algorim.,Min-heap with insert and extract_min operations.,algorim_a47 | |
| algo_a47_00941,backtracking,advanced,n_queens,O(n!),O(n^2),أكمل الكود التالي في Algorim: solve the n-queens problem in algorim.,N-Queens problem using backtracking.,algorim_a47 | |
| algo_a47_00942,commands,beginner,imagine_command,N/A,N/A,أكمل الكود التالي في Algorim: how do you ask the model to generate an image of an algorithm?,Command to generate a visual image of an algorithm or code.,algorim_a47 | |
| algo_a47_00943,commands,intermediate,compile_command,N/A,N/A,أكمل الكود التالي في Algorim: how do you compile an algorim function to machine code?,Command to compile Algorim code to executable bytecode.,algorim_a47 | |
| algo_a47_00944,commands,intermediate,debug_command,N/A,N/A,أكمل الكود التالي في Algorim: how do you debug an algorim function step by step?,Command to debug Algorim code with execution trace.,algorim_a47 | |
| algo_a47_00945,basic,beginner,swap,O(1),O(1),Explain and write in Algorim: write an algorim action to swap two integers.,Exchange values of two integer variables using a temporary variable.,algorim_a47 | |
| algo_a47_00946,math,beginner,absolute_value,O(1),O(1),Explain and write in Algorim: write an algorim function to compute the absolute value.,Returns the absolute value of an integer.,algorim_a47 | |
| algo_a47_00947,math,beginner,power,O(exp),O(1),Explain and write in Algorim: implement a power function in algorim.,Computes base raised to the power of exp using iteration.,algorim_a47 | |
| algo_a47_00948,math,beginner,factorial,O(n),O(1),Explain and write in Algorim: write the factorial function in algorim.,Computes n! iteratively.,algorim_a47 | |
| algo_a47_00949,recursion,intermediate,factorial_recursive,O(n),O(n),Explain and write in Algorim: write a recursive factorial function in algorim.,Recursive factorial computation.,algorim_a47 | |
| algo_a47_00950,math,intermediate,fibonacci,O(n),O(1),Explain and write in Algorim: compute the nth fibonacci number in algorim.,Computes the n-th Fibonacci number iteratively.,algorim_a47 | |
| algo_a47_00951,recursion,intermediate,fibonacci_recursive,O(2^n),O(n),Explain and write in Algorim: write a recursive fibonacci function in algorim.,Recursive Fibonacci using two recursive calls.,algorim_a47 | |
| algo_a47_00952,math,intermediate,gcd,"O(log(min(a,b)))",O(1),Explain and write in Algorim: implement gcd using euclidean algorithm in algorim.,Computes GCD using Euclidean algorithm.,algorim_a47 | |
| algo_a47_00953,math,intermediate,lcm,"O(log(min(a,b)))",O(1),Explain and write in Algorim: write an lcm function in algorim.,Computes LCM using GCD.,algorim_a47 | |
| algo_a47_00954,math,intermediate,primality_test,O(sqrt(n)),O(1),Explain and write in Algorim: write a primality test in algorim.,Checks if a number is prime using trial division up to sqrt(n).,algorim_a47 | |
| algo_a47_00955,arrays,beginner,array_sum,O(n),O(1),Explain and write in Algorim: sum all elements of an array in algorim.,Sums all elements of an integer array.,algorim_a47 | |
| algo_a47_00956,arrays,beginner,find_maximum,O(n),O(1),Explain and write in Algorim: find the maximum element in an array using algorim.,Finds the maximum element in an array.,algorim_a47 | |
| algo_a47_00957,arrays,beginner,find_minimum,O(n),O(1),Explain and write in Algorim: find the minimum element in an array using algorim.,Finds the minimum element in an array.,algorim_a47 | |
| algo_a47_00958,searching,beginner,linear_search,O(n),O(1),Explain and write in Algorim: implement linear search in algorim.,"Searches for target in array, returns index or -1.",algorim_a47 | |
| algo_a47_00959,searching,intermediate,binary_search,O(log n),O(1),Explain and write in Algorim: write binary search in algorim for a sorted array.,Binary search on sorted array. Returns index or -1.,algorim_a47 | |
| algo_a47_00960,arrays,beginner,reverse_array,O(n),O(1),Explain and write in Algorim: reverse an array in-place in algorim.,Reverses an array in-place using two pointers.,algorim_a47 | |
| algo_a47_00961,arrays,beginner,count_occurrences,O(n),O(1),Explain and write in Algorim: count occurrences of a value in an array using algorim.,Counts occurrences of val in array T.,algorim_a47 | |
| algo_a47_00962,arrays,beginner,copy_array,O(n),O(1),Explain and write in Algorim: write an array copy function in algorim.,Copies elements from src to dst array.,algorim_a47 | |
| algo_a47_00963,sorting,beginner,bubble_sort,O(n^2),O(1),Explain and write in Algorim: implement bubble sort in algorim.,Bubble sort with early exit optimization.,algorim_a47 | |
| algo_a47_00964,sorting,beginner,selection_sort,O(n^2),O(1),Explain and write in Algorim: implement selection sort in algorim.,Selection sort: finds minimum and places it at front.,algorim_a47 | |
| algo_a47_00965,sorting,intermediate,insertion_sort,O(n^2),O(1),Explain and write in Algorim: implement insertion sort in algorim.,Insertion sort: builds sorted array one element at a time.,algorim_a47 | |
| algo_a47_00966,sorting,advanced,merge_sort,O(n log n),O(n),Explain and write in Algorim: implement merge sort in algorim.,Merge sort: divide-and-conquer stable sorting algorithm.,algorim_a47 | |
| algo_a47_00967,sorting,advanced,quick_sort,"O(n log n) avg, O(n^2) worst",O(log n),Explain and write in Algorim: implement quick sort in algorim.,Quick sort with last element as pivot using Lomuto partition.,algorim_a47 | |
| algo_a47_00968,sorting,advanced,heap_sort,O(n log n),O(1),Explain and write in Algorim: implement heap sort in algorim.,Heap sort using max-heap.,algorim_a47 | |
| algo_a47_00969,linked_list,intermediate,linked_list_basic,"O(1) front, O(n) back",O(1),Explain and write in Algorim: implement singly linked list insert front and back in algorim.,Singly linked list node creation and insertion operations.,algorim_a47 | |
| algo_a47_00970,linked_list,intermediate,linked_list_delete,O(n),O(1),Explain and write in Algorim: delete a node with given value from a singly linked list in algorim.,Delete first occurrence of val from linked list.,algorim_a47 | |
| algo_a47_00971,linked_list,intermediate,reverse_linked_list,O(n),O(1),Explain and write in Algorim: reverse a singly linked list in algorim.,Reverses a singly linked list in-place.,algorim_a47 | |
| algo_a47_00972,linked_list,beginner,list_length,O(n),O(1),Explain and write in Algorim: find the length of a linked list in algorim.,Returns the length of a singly linked list.,algorim_a47 | |
| algo_a47_00973,data_structures,intermediate,stack,O(1) all ops,O(n),Explain and write in Algorim: implement a stack data structure in algorim.,"Stack implementation using array with push, pop, peek, isEmpty.",algorim_a47 | |
| algo_a47_00974,data_structures,intermediate,balanced_parentheses,O(n),O(n),Explain and write in Algorim: check if an expression has balanced parentheses in algorim.,Checks if parentheses/brackets/braces are balanced using a stack.,algorim_a47 | |
| algo_a47_00975,data_structures,intermediate,queue,O(1) all ops,O(n),Explain and write in Algorim: implement a circular queue in algorim.,"Circular queue implementation with enqueue, dequeue, isEmpty.",algorim_a47 | |
| algo_a47_00976,trees,intermediate,bst_insert,O(h) where h=height,O(h),Explain and write in Algorim: implement bst insertion in algorim.,Inserts a key into a Binary Search Tree.,algorim_a47 | |
| algo_a47_00977,trees,intermediate,bst_search,O(h),O(h),Explain and write in Algorim: search for a key in a bst using algorim.,Searches for a key in a Binary Search Tree.,algorim_a47 | |
| algo_a47_00978,trees,beginner,inorder_traversal,O(n),O(h),Explain and write in Algorim: write in-order traversal of a binary tree in algorim.,In-order traversal of binary tree (Left-Root-Right).,algorim_a47 | |
| algo_a47_00979,trees,beginner,preorder_traversal,O(n),O(h),Explain and write in Algorim: write pre-order traversal of a binary tree in algorim.,Pre-order traversal (Root-Left-Right).,algorim_a47 | |
| algo_a47_00980,trees,beginner,postorder_traversal,O(n),O(h),Explain and write in Algorim: write post-order traversal of a binary tree in algorim.,Post-order traversal (Left-Right-Root).,algorim_a47 | |
| algo_a47_00981,trees,intermediate,tree_height,O(n),O(h),Explain and write in Algorim: find the height of a binary tree in algorim.,Computes the height (depth) of a binary tree.,algorim_a47 | |
| algo_a47_00982,trees,beginner,count_nodes,O(n),O(h),Explain and write in Algorim: count the number of nodes in a binary tree in algorim.,Counts total nodes in a binary tree.,algorim_a47 | |
| algo_a47_00983,trees,intermediate,level_order_traversal,O(n),O(w) w=max width,Explain and write in Algorim: implement level-order (bfs) traversal of a binary tree in algorim.,BFS level-order traversal of binary tree using a queue.,algorim_a47 | |
| algo_a47_00984,graphs,advanced,depth_first_search,O(V+E),O(V),Explain and write in Algorim: implement depth first search (dfs) in algorim.,DFS graph traversal using adjacency matrix and recursion.,algorim_a47 | |
| algo_a47_00985,graphs,advanced,breadth_first_search,O(V+E),O(V),Explain and write in Algorim: implement breadth first search (bfs) in algorim.,BFS graph traversal using adjacency matrix and queue.,algorim_a47 | |
| algo_a47_00986,strings,beginner,string_length,O(n),O(1),Explain and write in Algorim: write a string length function in algorim.,Computes string length by counting until null terminator.,algorim_a47 | |
| algo_a47_00987,strings,beginner,palindrome_check,O(n),O(1),Explain and write in Algorim: check if a string is a palindrome in algorim.,Checks if a string is a palindrome using two pointers.,algorim_a47 | |
| algo_a47_00988,strings,beginner,string_reverse,O(n),O(1),Explain and write in Algorim: reverse a string in-place in algorim.,Reverses a string in-place.,algorim_a47 | |
| algo_a47_00989,strings,beginner,string_copy,O(n),O(1),Explain and write in Algorim: copy a string in algorim.,Copies string src to dst.,algorim_a47 | |
| algo_a47_00990,strings,beginner,count_character,O(n),O(1),Explain and write in Algorim: count occurrences of a character in a string in algorim.,Counts occurrences of character c in string s.,algorim_a47 | |
| algo_a47_00991,dynamic_programming,advanced,longest_common_subsequence,O(m*n),O(m*n),Explain and write in Algorim: implement lcs algorithm in algorim.,Finds the length of the Longest Common Subsequence using DP.,algorim_a47 | |
| algo_a47_00992,dynamic_programming,advanced,knapsack_0_1,O(n*W),O(n*W),Explain and write in Algorim: implement the 0/1 knapsack problem in algorim.,0/1 Knapsack problem using bottom-up DP.,algorim_a47 | |
| algo_a47_00993,dynamic_programming,advanced,coin_change,O(amount * n),O(amount),Explain and write in Algorim: implement coin change problem in algorim.,Minimum number of coins to make an amount (DP).,algorim_a47 | |
| algo_a47_00994,number_theory,intermediate,sieve_eratosthenes,O(n log log n),O(n),Explain and write in Algorim: implement the sieve of eratosthenes in algorim.,Sieve of Eratosthenes to find all primes up to n.,algorim_a47 | |
| algo_a47_00995,number_theory,beginner,binary_to_decimal,O(n),O(1),Explain and write in Algorim: convert binary to decimal in algorim.,Converts binary string to decimal integer.,algorim_a47 | |
| algo_a47_00996,data_structures,advanced,hash_table,"O(1) avg, O(n) worst",O(n),Explain and write in Algorim: implement a hash table with chaining in algorim.,Hash table with separate chaining collision resolution.,algorim_a47 | |
| algo_a47_00997,matrix,intermediate,matrix_multiplication,O(n^3),O(1) extra,Explain and write in Algorim: implement matrix multiplication in algorim.,"Multiplies two n×n matrices A and B, stores result in C.",algorim_a47 | |
| algo_a47_00998,matrix,beginner,matrix_transpose,O(n^2),O(1),Explain and write in Algorim: transpose a matrix in-place in algorim.,Transposes a square matrix in-place.,algorim_a47 | |
| algo_a47_00999,data_structures,advanced,min_heap,O(log n) insert/extract,O(n),Explain and write in Algorim: implement a min-heap in algorim.,Min-heap with insert and extract_min operations.,algorim_a47 | |
| algo_a47_01000,backtracking,advanced,n_queens,O(n!),O(n^2),Explain and write in Algorim: solve the n-queens problem in algorim.,N-Queens problem using backtracking.,algorim_a47 | |
| algo_original_0001,original,intermediate,code_002,varies,varies,Analyze and explain this Algorim code from code_002.algo,Original code example: code_002.algo,algorim_a47 | |
| algo_original_0002,original,intermediate,code_025,varies,varies,Analyze and explain this Algorim code from code_025.algo,Original code example: code_025.algo,algorim_a47 | |
| algo_original_0003,original,intermediate,code_032,varies,varies,Analyze and explain this Algorim code from code_032.algo,Original code example: code_032.algo,algorim_a47 | |
| algo_original_0004,original,intermediate,code_020,varies,varies,Analyze and explain this Algorim code from code_020.algo,Original code example: code_020.algo,algorim_a47 | |
| algo_original_0005,original,intermediate,code_010,varies,varies,Analyze and explain this Algorim code from code_010.algo,Original code example: code_010.algo,algorim_a47 | |
| algo_original_0006,original,intermediate,code_036,varies,varies,Analyze and explain this Algorim code from code_036.algo,Original code example: code_036.algo,algorim_a47 | |
| algo_original_0007,original,intermediate,code_033,varies,varies,Analyze and explain this Algorim code from code_033.algo,Original code example: code_033.algo,algorim_a47 | |
| algo_original_0008,original,intermediate,code_017,varies,varies,Analyze and explain this Algorim code from code_017.algo,Original code example: code_017.algo,algorim_a47 | |
| algo_original_0009,original,intermediate,code_029,varies,varies,Analyze and explain this Algorim code from code_029.algo,Original code example: code_029.algo,algorim_a47 | |
| algo_original_0010,original,intermediate,code_022,varies,varies,Analyze and explain this Algorim code from code_022.algo,Original code example: code_022.algo,algorim_a47 | |
| algo_original_0011,original,intermediate,code_013,varies,varies,Analyze and explain this Algorim code from code_013.algo,Original code example: code_013.algo,algorim_a47 | |
| algo_original_0012,original,intermediate,code_012,varies,varies,Analyze and explain this Algorim code from code_012.algo,Original code example: code_012.algo,algorim_a47 | |
| algo_original_0013,original,intermediate,code_023,varies,varies,Analyze and explain this Algorim code from code_023.algo,Original code example: code_023.algo,algorim_a47 | |
| algo_original_0014,original,intermediate,code_024,varies,varies,Analyze and explain this Algorim code from code_024.algo,Original code example: code_024.algo,algorim_a47 | |
| algo_original_0015,original,intermediate,code_031,varies,varies,Analyze and explain this Algorim code from code_031.algo,Original code example: code_031.algo,algorim_a47 | |
| algo_original_0016,original,intermediate,code_009,varies,varies,Analyze and explain this Algorim code from code_009.algo,Original code example: code_009.algo,algorim_a47 | |
| algo_original_0017,original,intermediate,code_035,varies,varies,Analyze and explain this Algorim code from code_035.algo,Original code example: code_035.algo,algorim_a47 | |
| algo_original_0018,original,intermediate,code_049,varies,varies,Analyze and explain this Algorim code from code_049.algo,Original code example: code_049.algo,algorim_a47 | |
| algo_original_0019,original,intermediate,code_007,varies,varies,Analyze and explain this Algorim code from code_007.algo,Original code example: code_007.algo,algorim_a47 | |
| algo_original_0020,original,intermediate,code_005,varies,varies,Analyze and explain this Algorim code from code_005.algo,Original code example: code_005.algo,algorim_a47 | |
| algo_original_0021,original,intermediate,code_034,varies,varies,Analyze and explain this Algorim code from code_034.algo,Original code example: code_034.algo,algorim_a47 | |
| algo_original_0022,original,intermediate,code_001,varies,varies,Analyze and explain this Algorim code from code_001.algo,Original code example: code_001.algo,algorim_a47 | |
| algo_original_0023,original,intermediate,code_008,varies,varies,Analyze and explain this Algorim code from code_008.algo,Original code example: code_008.algo,algorim_a47 | |
| algo_original_0024,original,intermediate,code_004,varies,varies,Analyze and explain this Algorim code from code_004.algo,Original code example: code_004.algo,algorim_a47 | |
| algo_original_0025,original,intermediate,code_027,varies,varies,Analyze and explain this Algorim code from code_027.algo,Original code example: code_027.algo,algorim_a47 | |
| algo_original_0026,original,intermediate,code_003,varies,varies,Analyze and explain this Algorim code from code_003.algo,Original code example: code_003.algo,algorim_a47 | |
| algo_original_0027,original,intermediate,code_026,varies,varies,Analyze and explain this Algorim code from code_026.algo,Original code example: code_026.algo,algorim_a47 | |
| algo_original_0028,original,intermediate,code_019,varies,varies,Analyze and explain this Algorim code from code_019.algo,Original code example: code_019.algo,algorim_a47 | |
| algo_original_0029,original,intermediate,code_028,varies,varies,Analyze and explain this Algorim code from code_028.algo,Original code example: code_028.algo,algorim_a47 | |
| algo_original_0030,original,intermediate,code_006,varies,varies,Analyze and explain this Algorim code from code_006.algo,Original code example: code_006.algo,algorim_a47 | |
| algo_original_0031,original,intermediate,code_011,varies,varies,Analyze and explain this Algorim code from code_011.algo,Original code example: code_011.algo,algorim_a47 | |
| algo_original_0032,original,intermediate,code_021,varies,varies,Analyze and explain this Algorim code from code_021.algo,Original code example: code_021.algo,algorim_a47 | |
| algo_original_0033,original,intermediate,code_018,varies,varies,Analyze and explain this Algorim code from code_018.algo,Original code example: code_018.algo,algorim_a47 | |
| algo_original_0034,original,intermediate,code_030,varies,varies,Analyze and explain this Algorim code from code_030.algo,Original code example: code_030.algo,algorim_a47 | |