About VisiGrab: Learn to Code & DSA
VisiGrab is your interactive DSA visualizer - the easiest way to master Python coding, Java, and C++ programming through step-by-step visual animations. Whether you're a computer science student preparing for a code study...
VisiGrab is your interactive DSA visualizer - the easiest way to master Python coding, Java, and C++ programming through step-by-step visual animations. Whether you're a computer science student preparing for a code study exam, a self-taught developer getting ready for tech interviews, or an experienced programmer brushing up on data structures, VisiGrab makes learning intuitive and engaging. Why VisiGrab? The true value of VisiGrab isn’t just the content itself-which you can find online for free-but the way you experience and process it. Studying data structures from raw sources often feels like wandering blindly through a dark cave. VisiGrab acts as your guide, taking you by the hand and leading you smoothly along the winding paths into the light. It is also the ultimate tool to overcome imposter syndrome. Many talented programmers feel like frauds simply because they lack a formal background in algorithms. VisiGrab cures this anxiety by making core computer science concepts so intuitive that they finally click. As a student or developer, you have a choice: waste weeks digging through tons of unstructured tutorials, or build a rock-solid computer science foundation in just a few days. Time is your most valuable resource, and this study app is designed to save it. By delivering content in an adapted, step-by-step sequence, VisiGrab builds a cohesive mental map in your mind, transforming you into a confident engineer. Comprehensive DSA Coverage Data Structures: . Array, Linked List, Doubly Linked List . Stack, Queue . Min-Heap . Hash Table (chaining & open addressing techniques) . Binary Search Tree (BST) & Trie . AVL Tree & Red-Black Tree . B-Tree . Graph & Graph Constructor (build your own graphs) Sorting & Operations: . Bubble, Selection, Insertion, Merge, Heap, Quick Sort . Pre-order, In-order, Post-order, and Breadth-first traversal (BFS) . Inserting and deleting nodes in BST, AVL, and Red-Black Trees . Depth-first search (DFS) & Dijkstra's algorithm (shortest path) . Bellman-Ford, Prim's, and Kruskal's Minimum Spanning Tree . Topological Sort & Union-Find Code Examples in Java, Python, and C++ Every visual DSA animation is accompanied by its implementation code in Java app format, Python coding, and C++. See the direct link between the code and the visual animation - understand not just what the concept does, but how the program makes it happen. Full source code available on GitHub. Available in 10 Languages VisiGrab supports English, German, French, Spanish, Portuguese, Polish, Ukrainian, Japanese, Korean, and Chinese (Simplified) - making it accessible to CS students worldwide. Perfect for Coding Interview Preparation Preparing for your next technical interview at a top tech company? VisiGrab helps you visualize and understand the DSA topics most commonly asked in coding interviews. Build a strong foundation in data structures and go into your interview with confidence. Ideal for LeetCode practice, competitive programming preparation, and CS exam study. Gamified Learning Experience VisiGrab features a gaming-inspired design that makes studying coding fun and motivating. Interactive controls let you step through each node at your own pace, manipulate data in real-time, and see results instantly. Key Features . Interactive visual animations for every binary tree, graph, and structure . Step-by-step execution - pause, rewind, and control the pace . Code view with Java, Python, and C++ implementations . Offline access - study app anywhere, no internet required . Gamified interface that keeps you engaged . One-time purchase - no subscriptions, no ads, no recurring fees Learn DSA Anytime, Anywhere Whether you're commuting, waiting between classes, or studying at home, VisiGrab turns your phone into a powerful code learning study app. No internet connection needed - your complete DSA course is always available offline. Download VisiGrab today and start mastering data structures visually!
Version History Added B-Tree — add and remove keys, choose the maximum degree, and watch the nodes split, borrow and merge 1.23.0 Sep 25 • Added end-of-topic quizzes to every remaining topic — sorting algorithms, trees, traversals, and graph algorithms • Heap: build-heap now runs step by step from the info dialog, showing every comparison and swap 1.22.0 Aug 28 • Rebuilt the Hash Table topic as a slide-show presentation — reworked separate chaining and added open addressing, with insert, search, and delete • Long-press a topic on the home screen to mark it as learned 1.21.0 Aug 16 Added Min-Heap 1.20.0 Jul 22 Added end-of-topic quizzes for Array, Linked List, Doubly Linked List, Queue, and Stack — open one anytime from the menu 1.19.0 Jul 2 Added Doubly Linked List 1.18.0 Jun 29 Added C++ as a third programming language — view any topic's code in Java, Python, or C++. 1.17.0 Jun 13 • Added a "Slides" table of contents to Array, Linked List, Stack, and Queue presentations — tap any row to jump straight to that slide. • These presentations now remember your last opened slide. Restart in the menu jumps back to the first slide. 1.16.0 Jun 7 Added Trie data structure with Insert, Delete, and StartsWith (Autocomplete) operations. 1.15.0 May 25 Added Topological Sort (Kahn's algorithm) with graph constructor integration. 1.14.0 May 6 Added Bellman-Ford to graph constructor 1.13.2 Apr 12 Improved value input widget across Sorting Algorithms and Graph Constructor 1.13.1 Apr 5 - Added Bellman-Ford algorithm - Expanded Dijkstra info dialog - Code section: Replit replaced with GitHub link 1.13.0 Mar 25 • Improved clarity of educational content • Added 9 new languages: Portuguese (Brazil), Spanish (Latin America), German, French, Polish, Ukrainian, Korean, Japanese, and Simplified Chinese • A brief Unity logo now appears at startup — we've moved to Unity's free tier. This helps us reduce development costs. • New app icon & name 1.12.0 12/09/2025 1. Union-Find Data Structure: Now available to enhance understanding of network connectivity and related challenges. 2. Kruskal’s Algorithm: Newly added to provide a robust method for computing the Minimum Spanning Tree (MST) in weighted graphs. 3. Enhanced Algorithm Code: Refined code for DFS, BFS, Prim’s MST, and Dijkstra ensures more effective learning experiences. 4. New Look: Our app icon and name have been updated to better reflect our evolving brand and mission. 1.11.0 08/15/2024 The "Random" menu item has been replaced with "Examples" for both the Minimum Spanning Tree and Dijkstra's algorithm presentations. Similar to the updates made previously for DFS and BFS, each of these sections now includes four predefined examples. This change fosters a more structured and illustrative learning experience, allowing for a clear demonstration of these algorithms on specific, consistent examples. 1.10.7 05/14/2024 1. Enhanced visual presentations for Bubble Sort, Selection Sort, Insertion Sort, and Quick Sort, including both Lomuto and Hoare partition schemes. Minor refinements have also been made to Merge Sort and Heap Sort to enhance learning engagement. 2. The code for all sorting algorithms has been improved for better readability. 1.10.6 05/07/2024 The presentations for Depth-First Search (DFS) and Breadth-First Search (BFS) graph traversal algorithms have been redesigned to enhance the learning experience. 1.10.5 03/31/2024 Expanded Hash Table Insights: The info dialog for the Hash Table topic now includes additional information, offering a deeper understanding of this data structure. Revised Hash Table Code Example: The code example for the Hash Table has been revised to enhance understanding. 1.10.4 03/11/2024 Small UI Bug Fix 1.10.3 02/29/2024 1. Enhanced Information Dialogues: The info dialogues for Array, Linked List, Stack, and Queue have been updated with additional information. 2. Slide Navigation Indicator: For a better learning experience during slide-like presentations on Array, Linked List, Stack, and Queue, we've added a slide navigation indicator. This new feature displays the current slide number and the total number of slides, making it easier to track your progress through the material. 1.10.2 02/28/2024 We've updated the Home screen with a new look and feel to enhance your experience right from the start. 1.10.1 02/24/2024 1. Self-Balancing Trees Practice: Practice inserting and deleting nodes in AVL and Red-Black trees. 2. Redesigned Inserting and Deleting in Binary Search Trees: The topics on inserting and deleting in regular binary search trees have been completely redesigned for an improved learning experience. 1.10.0 02/11/2024 Fixed an issue affecting some users where the app might not unlock after purchase. 1.9.2 09/27/2023 You can now select a theme for the code, tailoring the appearance to your individual preference. 1.9.1 09/10/2023
Previous Versions
Here you can find the changelog of VisiGrab: Learn to Code & DSA since it was posted on our website on 2023-05-24 06:43:38.
The latest version is 1.23.0 and it was updated on 2026-10-10 05:59:08. See below the changes in each version.
VisiGrab: Learn to Code & DSA version 1.23.0
Updated At: 2026-10-08
Changes: Version History Added B-Tree — add and remove keys, choose the maximum degree, and watch the nodes split, borrow and merge 1.23.0 Sep 25 • Added end-of-topic quizzes to every remaining topic — sorting algorithms, trees, traversals, and graph algorithms
• Heap: build-heap now runs step by step from the info dialog, showing every comparison and swap 1.22.0 Aug 28 • Rebuilt the Hash Table topic as a slide-show presentation — reworked separate chaining and added open addressing, with insert, search, and delete
• Long-press a topic on the home screen to mark it as learned 1.21.0 Aug 16 Added Min-Heap 1.20.0 Jul 22 Added end-of-topic quizzes for Array, Linked List, Doubly Linked List, Queue, and Stack — open one anytime from the menu 1.19.0 Jul 2 Added Doubly Linked List 1.18.0 Jun 29 Added C++ as a third programming language — view any topic's code in Java, Python, or C++. 1.17.0 Jun 13 • Added a "Slides" table of contents to Array, Linked List, Stack, and Queue presentations — tap any row to jump straight to that slide.
• These presentations now remember your last opened slide. Restart in the menu jumps back to the first slide. 1.16.0 Jun 7 Added Trie data structure with Insert, Delete, and StartsWith (Autocomplete) operations. 1.15.0 May 25 Added Topological Sort (Kahn's algorithm) with graph constructor integration. 1.14.0 May 6 Added Bellman-Ford to graph constructor 1.13.2 Apr 12 Improved value input widget across Sorting Algorithms and Graph Constructor 1.13.1 Apr 5 - Added Bellman-Ford algorithm
- Expanded Dijkstra info dialog
- Code section: Replit replaced with GitHub link 1.13.0 Mar 25 • Improved clarity of educational content
• Added 9 new languages: Portuguese (Brazil), Spanish (Latin America), German, French, Polish, Ukrainian, Korean, Japanese, and Simplified Chinese
• A brief Unity logo now appears at startup — we've moved to Unity's free tier. This helps us reduce development costs.
• New app icon & name 1.12.0 12/09/2025 1. Union-Find Data Structure: Now available to enhance understanding of network connectivity and related challenges.
2. Kruskal’s Algorithm: Newly added to provide a robust method for computing the Minimum Spanning Tree (MST) in weighted graphs.
3. Enhanced Algorithm Code: Refined code for DFS, BFS, Prim’s MST, and Dijkstra ensures more effective learning experiences.
4. New Look: Our app icon and name have been updated to better reflect our evolving brand and mission. 1.11.0 08/15/2024 The "Random" menu item has been replaced with "Examples" for both the Minimum Spanning Tree and Dijkstra's algorithm presentations. Similar to the updates made previously for DFS and BFS, each of these sections now includes four predefined examples. This change fosters a more structured and illustrative learning experience, allowing for a clear demonstration of these algorithms on specific, consistent examples. 1.10.7 05/14/2024 1. Enhanced visual presentations for Bubble Sort, Selection Sort, Insertion Sort, and Quick Sort, including both Lomuto and Hoare partition schemes. Minor refinements have also been made to Merge Sort and Heap Sort to enhance learning engagement.
2. The code for all sorting algorithms has been improved for better readability. 1.10.6 05/07/2024 The presentations for Depth-First Search (DFS) and Breadth-First Search (BFS) graph traversal algorithms have been redesigned to enhance the learning experience. 1.10.5 03/31/2024 Expanded Hash Table Insights: The info dialog for the Hash Table topic now includes additional information, offering a deeper understanding of this data structure.
Revised Hash Table Code Example: The code example for the Hash Table has been revised to enhance understanding. 1.10.4 03/11/2024 Small UI Bug Fix 1.10.3 02/29/2024 1. Enhanced Information Dialogues: The info dialogues for Array, Linked List, Stack, and Queue have been updated with additional information.
2. Slide Navigation Indicator: For a better learning experience during slide-like presentations on Array, Linked List, Stack, and Queue, we've added a slide navigation indicator. This new feature displays the current slide number and the total number of slides, making it easier to track your progress through the material. 1.10.2 02/28/2024 We've updated the Home screen with a new look and feel to enhance your experience right from the start. 1.10.1 02/24/2024 1. Self-Balancing Trees Practice: Practice inserting and deleting nodes in AVL and Red-Black trees.
2. Redesigned Inserting and Deleting in Binary Search Trees: The topics on inserting and deleting in regular binary search trees have been completely redesigned for an improved learning experience. 1.10.0 02/11/2024 Fixed an issue affecting some users where the app might not unlock after purchase. 1.9.2 09/27/2023 You can now select a theme for the code, tailoring the appearance to your individual preference. 1.9.1 09/10/2023
VisiGrab: Learn to Code & DSA version 1.23.0
Updated At: 2026-10-01
Changes: Version History Added B-Tree — add and remove keys, choose the maximum degree, and watch the nodes split, borrow and merge 1.23.0 6d ago • Added end-of-topic quizzes to every remaining topic — sorting algorithms, trees, traversals, and graph algorithms
• Heap: build-heap now runs step by step from the info dialog, showing every comparison and swap 1.22.0 Aug 28 • Rebuilt the Hash Table topic as a slide-show presentation — reworked separate chaining and added open addressing, with insert, search, and delete
• Long-press a topic on the home screen to mark it as learned 1.21.0 Aug 16 Added Min-Heap 1.20.0 Jul 22 Added end-of-topic quizzes for Array, Linked List, Doubly Linked List, Queue, and Stack — open one anytime from the menu 1.19.0 Jul 2 Added Doubly Linked List 1.18.0 Jun 29 Added C++ as a third programming language — view any topic's code in Java, Python, or C++. 1.17.0 Jun 13 • Added a "Slides" table of contents to Array, Linked List, Stack, and Queue presentations — tap any row to jump straight to that slide.
• These presentations now remember your last opened slide. Restart in the menu jumps back to the first slide. 1.16.0 Jun 7 Added Trie data structure with Insert, Delete, and StartsWith (Autocomplete) operations. 1.15.0 May 25 Added Topological Sort (Kahn's algorithm) with graph constructor integration. 1.14.0 May 6 Added Bellman-Ford to graph constructor 1.13.2 Apr 12 Improved value input widget across Sorting Algorithms and Graph Constructor 1.13.1 Apr 5 - Added Bellman-Ford algorithm
- Expanded Dijkstra info dialog
- Code section: Replit replaced with GitHub link 1.13.0 Mar 25 • Improved clarity of educational content
• Added 9 new languages: Portuguese (Brazil), Spanish (Latin America), German, French, Polish, Ukrainian, Korean, Japanese, and Simplified Chinese
• A brief Unity logo now appears at startup — we've moved to Unity's free tier. This helps us reduce development costs.
• New app icon & name 1.12.0 12/09/2025 1. Union-Find Data Structure: Now available to enhance understanding of network connectivity and related challenges.
2. Kruskal’s Algorithm: Newly added to provide a robust method for computing the Minimum Spanning Tree (MST) in weighted graphs.
3. Enhanced Algorithm Code: Refined code for DFS, BFS, Prim’s MST, and Dijkstra ensures more effective learning experiences.
4. New Look: Our app icon and name have been updated to better reflect our evolving brand and mission. 1.11.0 08/15/2024 The "Random" menu item has been replaced with "Examples" for both the Minimum Spanning Tree and Dijkstra's algorithm presentations. Similar to the updates made previously for DFS and BFS, each of these sections now includes four predefined examples. This change fosters a more structured and illustrative learning experience, allowing for a clear demonstration of these algorithms on specific, consistent examples. 1.10.7 05/14/2024 1. Enhanced visual presentations for Bubble Sort, Selection Sort, Insertion Sort, and Quick Sort, including both Lomuto and Hoare partition schemes. Minor refinements have also been made to Merge Sort and Heap Sort to enhance learning engagement.
2. The code for all sorting algorithms has been improved for better readability. 1.10.6 05/07/2024 The presentations for Depth-First Search (DFS) and Breadth-First Search (BFS) graph traversal algorithms have been redesigned to enhance the learning experience. 1.10.5 03/31/2024 Expanded Hash Table Insights: The info dialog for the Hash Table topic now includes additional information, offering a deeper understanding of this data structure.
Revised Hash Table Code Example: The code example for the Hash Table has been revised to enhance understanding. 1.10.4 03/11/2024 Small UI Bug Fix 1.10.3 02/29/2024 1. Enhanced Information Dialogues: The info dialogues for Array, Linked List, Stack, and Queue have been updated with additional information.
2. Slide Navigation Indicator: For a better learning experience during slide-like presentations on Array, Linked List, Stack, and Queue, we've added a slide navigation indicator. This new feature displays the current slide number and the total number of slides, making it easier to track your progress through the material. 1.10.2 02/28/2024 We've updated the Home screen with a new look and feel to enhance your experience right from the start. 1.10.1 02/24/2024 1. Self-Balancing Trees Practice: Practice inserting and deleting nodes in AVL and Red-Black trees.
2. Redesigned Inserting and Deleting in Binary Search Trees: The topics on inserting and deleting in regular binary search trees have been completely redesigned for an improved learning experience. 1.10.0 02/11/2024 Fixed an issue affecting some users where the app might not unlock after purchase. 1.9.2 09/27/2023 You can now select a theme for the code, tailoring the appearance to your individual preference. 1.9.1 09/10/2023
VisiGrab: Learn to Code & DSA version 1.22.0
Updated At: 2026-09-24
Changes: Version History • Added end-of-topic quizzes to every remaining topic — sorting algorithms, trees, traversals, and graph algorithms
• Heap: build-heap now runs step by step from the info dialog, showing every comparison and swap 1.22.0 Aug 28 • Rebuilt the Hash Table topic as a slide-show presentation — reworked separate chaining and added open addressing, with insert, search, and delete
• Long-press a topic on the home screen to mark it as learned 1.21.0 Aug 16 Added Min-Heap 1.20.0 Jul 22 Added end-of-topic quizzes for Array, Linked List, Doubly Linked List, Queue, and Stack — open one anytime from the menu 1.19.0 Jul 2 Added Doubly Linked List 1.18.0 Jun 29 Added C++ as a third programming language — view any topic's code in Java, Python, or C++. 1.17.0 Jun 13 • Added a "Slides" table of contents to Array, Linked List, Stack, and Queue presentations — tap any row to jump straight to that slide.
• These presentations now remember your last opened slide. Restart in the menu jumps back to the first slide. 1.16.0 Jun 7 Added Trie data structure with Insert, Delete, and StartsWith (Autocomplete) operations. 1.15.0 May 25 Added Topological Sort (Kahn's algorithm) with graph constructor integration. 1.14.0 May 6 Added Bellman-Ford to graph constructor 1.13.2 Apr 12 Improved value input widget across Sorting Algorithms and Graph Constructor 1.13.1 Apr 5 - Added Bellman-Ford algorithm
- Expanded Dijkstra info dialog
- Code section: Replit replaced with GitHub link 1.13.0 Mar 25 • Improved clarity of educational content
• Added 9 new languages: Portuguese (Brazil), Spanish (Latin America), German, French, Polish, Ukrainian, Korean, Japanese, and Simplified Chinese
• A brief Unity logo now appears at startup — we've moved to Unity's free tier. This helps us reduce development costs.
• New app icon & name 1.12.0 12/09/2025 1. Union-Find Data Structure: Now available to enhance understanding of network connectivity and related challenges.
2. Kruskal’s Algorithm: Newly added to provide a robust method for computing the Minimum Spanning Tree (MST) in weighted graphs.
3. Enhanced Algorithm Code: Refined code for DFS, BFS, Prim’s MST, and Dijkstra ensures more effective learning experiences.
4. New Look: Our app icon and name have been updated to better reflect our evolving brand and mission. 1.11.0 08/15/2024 The "Random" menu item has been replaced with "Examples" for both the Minimum Spanning Tree and Dijkstra's algorithm presentations. Similar to the updates made previously for DFS and BFS, each of these sections now includes four predefined examples. This change fosters a more structured and illustrative learning experience, allowing for a clear demonstration of these algorithms on specific, consistent examples. 1.10.7 05/14/2024 1. Enhanced visual presentations for Bubble Sort, Selection Sort, Insertion Sort, and Quick Sort, including both Lomuto and Hoare partition schemes. Minor refinements have also been made to Merge Sort and Heap Sort to enhance learning engagement.
2. The code for all sorting algorithms has been improved for better readability. 1.10.6 05/07/2024 The presentations for Depth-First Search (DFS) and Breadth-First Search (BFS) graph traversal algorithms have been redesigned to enhance the learning experience. 1.10.5 03/31/2024 Expanded Hash Table Insights: The info dialog for the Hash Table topic now includes additional information, offering a deeper understanding of this data structure.
Revised Hash Table Code Example: The code example for the Hash Table has been revised to enhance understanding. 1.10.4 03/11/2024 Small UI Bug Fix 1.10.3 02/29/2024 1. Enhanced Information Dialogues: The info dialogues for Array, Linked List, Stack, and Queue have been updated with additional information.
2. Slide Navigation Indicator: For a better learning experience during slide-like presentations on Array, Linked List, Stack, and Queue, we've added a slide navigation indicator. This new feature displays the current slide number and the total number of slides, making it easier to track your progress through the material. 1.10.2 02/28/2024 We've updated the Home screen with a new look and feel to enhance your experience right from the start. 1.10.1 02/24/2024 1. Self-Balancing Trees Practice: Practice inserting and deleting nodes in AVL and Red-Black trees.
2. Redesigned Inserting and Deleting in Binary Search Trees: The topics on inserting and deleting in regular binary search trees have been completely redesigned for an improved learning experience. 1.10.0 02/11/2024 Fixed an issue affecting some users where the app might not unlock after purchase. 1.9.2 09/27/2023 You can now select a theme for the code, tailoring the appearance to your individual preference. 1.9.1 09/10/2023 1. Experience a complete redesign of the pre-order, in-order, post-order, and breadth-first binary tree traversals. Gain a deeper understanding of these traversals as you explore their workings in more detail.
2. Create custom binary trees using the new Binary Tree Constructor. Accessible from the menu, it allows you to experiment with different node values and structures. Please note that the Binary Tree Constructor is currently limited to use within the context of binary tree traversal algorithms. 1.9.0 06/29/2023
VisiGrab: Learn to Code & DSA version 1.22.0
Updated At: 2026-09-03
Changes: Version History • Added end-of-topic quizzes to every remaining topic — sorting algorithms, trees, traversals, and graph algorithms
• Heap: build-heap now runs step by step from the info dialog, showing every comparison and swap 1.22.0 5d ago • Rebuilt the Hash Table topic as a slide-show presentation — reworked separate chaining and added open addressing, with insert, search, and delete
• Long-press a topic on the home screen to mark it as learned 1.21.0 Aug 16 Added Min-Heap 1.20.0 Jul 22 Added end-of-topic quizzes for Array, Linked List, Doubly Linked List, Queue, and Stack — open one anytime from the menu 1.19.0 Jul 2 Added Doubly Linked List 1.18.0 Jun 29 Added C++ as a third programming language — view any topic's code in Java, Python, or C++. 1.17.0 Jun 13 • Added a "Slides" table of contents to Array, Linked List, Stack, and Queue presentations — tap any row to jump straight to that slide.
• These presentations now remember your last opened slide. Restart in the menu jumps back to the first slide. 1.16.0 Jun 7 Added Trie data structure with Insert, Delete, and StartsWith (Autocomplete) operations. 1.15.0 May 25 Added Topological Sort (Kahn's algorithm) with graph constructor integration. 1.14.0 May 6 Added Bellman-Ford to graph constructor 1.13.2 Apr 12 Improved value input widget across Sorting Algorithms and Graph Constructor 1.13.1 Apr 5 - Added Bellman-Ford algorithm
- Expanded Dijkstra info dialog
- Code section: Replit replaced with GitHub link 1.13.0 Mar 25 • Improved clarity of educational content
• Added 9 new languages: Portuguese (Brazil), Spanish (Latin America), German, French, Polish, Ukrainian, Korean, Japanese, and Simplified Chinese
• A brief Unity logo now appears at startup — we've moved to Unity's free tier. This helps us reduce development costs.
• New app icon & name 1.12.0 12/09/2025 1. Union-Find Data Structure: Now available to enhance understanding of network connectivity and related challenges.
2. Kruskal’s Algorithm: Newly added to provide a robust method for computing the Minimum Spanning Tree (MST) in weighted graphs.
3. Enhanced Algorithm Code: Refined code for DFS, BFS, Prim’s MST, and Dijkstra ensures more effective learning experiences.
4. New Look: Our app icon and name have been updated to better reflect our evolving brand and mission. 1.11.0 08/15/2024 The "Random" menu item has been replaced with "Examples" for both the Minimum Spanning Tree and Dijkstra's algorithm presentations. Similar to the updates made previously for DFS and BFS, each of these sections now includes four predefined examples. This change fosters a more structured and illustrative learning experience, allowing for a clear demonstration of these algorithms on specific, consistent examples. 1.10.7 05/14/2024 1. Enhanced visual presentations for Bubble Sort, Selection Sort, Insertion Sort, and Quick Sort, including both Lomuto and Hoare partition schemes. Minor refinements have also been made to Merge Sort and Heap Sort to enhance learning engagement.
2. The code for all sorting algorithms has been improved for better readability. 1.10.6 05/07/2024 The presentations for Depth-First Search (DFS) and Breadth-First Search (BFS) graph traversal algorithms have been redesigned to enhance the learning experience. 1.10.5 03/31/2024 Expanded Hash Table Insights: The info dialog for the Hash Table topic now includes additional information, offering a deeper understanding of this data structure.
Revised Hash Table Code Example: The code example for the Hash Table has been revised to enhance understanding. 1.10.4 03/11/2024 Small UI Bug Fix 1.10.3 02/29/2024 1. Enhanced Information Dialogues: The info dialogues for Array, Linked List, Stack, and Queue have been updated with additional information.
2. Slide Navigation Indicator: For a better learning experience during slide-like presentations on Array, Linked List, Stack, and Queue, we've added a slide navigation indicator. This new feature displays the current slide number and the total number of slides, making it easier to track your progress through the material. 1.10.2 02/28/2024 We've updated the Home screen with a new look and feel to enhance your experience right from the start. 1.10.1 02/24/2024 1. Self-Balancing Trees Practice: Practice inserting and deleting nodes in AVL and Red-Black trees.
2. Redesigned Inserting and Deleting in Binary Search Trees: The topics on inserting and deleting in regular binary search trees have been completely redesigned for an improved learning experience. 1.10.0 02/11/2024 Fixed an issue affecting some users where the app might not unlock after purchase. 1.9.2 09/27/2023 You can now select a theme for the code, tailoring the appearance to your individual preference. 1.9.1 09/10/2023 1. Experience a complete redesign of the pre-order, in-order, post-order, and breadth-first binary tree traversals. Gain a deeper understanding of these traversals as you explore their workings in more detail.
2. Create custom binary trees using the new Binary Tree Constructor. Accessible from the menu, it allows you to experiment with different node values and structures. Please note that the Binary Tree Constructor is currently limited to use within the context of binary tree traversal algorithms. 1.9.0 06/29/2023
VisiGrab: Learn to Code & DSA version 1.20.0
Updated At: 2026-08-12
Changes: Version History Added Min-Heap 1.20.0 Jul 22 Added end-of-topic quizzes for Array, Linked List, Doubly Linked List, Queue, and Stack — open one anytime from the menu 1.19.0 Jul 2 Added Doubly Linked List 1.18.0 Jun 29 Added C++ as a third programming language — view any topic's code in Java, Python, or C++. 1.17.0 Jun 13 • Added a "Slides" table of contents to Array, Linked List, Stack, and Queue presentations — tap any row to jump straight to that slide.
• These presentations now remember your last opened slide. Restart in the menu jumps back to the first slide. 1.16.0 Jun 7 Added Trie data structure with Insert, Delete, and StartsWith (Autocomplete) operations. 1.15.0 May 25 Added Topological Sort (Kahn's algorithm) with graph constructor integration. 1.14.0 May 6 Added Bellman-Ford to graph constructor 1.13.2 Apr 12 Improved value input widget across Sorting Algorithms and Graph Constructor 1.13.1 Apr 5 - Added Bellman-Ford algorithm
- Expanded Dijkstra info dialog
- Code section: Replit replaced with GitHub link 1.13.0 Mar 25 • Improved clarity of educational content
• Added 9 new languages: Portuguese (Brazil), Spanish (Latin America), German, French, Polish, Ukrainian, Korean, Japanese, and Simplified Chinese
• A brief Unity logo now appears at startup — we've moved to Unity's free tier. This helps us reduce development costs.
• New app icon & name 1.12.0 12/09/2025 1. Union-Find Data Structure: Now available to enhance understanding of network connectivity and related challenges.
2. Kruskal’s Algorithm: Newly added to provide a robust method for computing the Minimum Spanning Tree (MST) in weighted graphs.
3. Enhanced Algorithm Code: Refined code for DFS, BFS, Prim’s MST, and Dijkstra ensures more effective learning experiences.
4. New Look: Our app icon and name have been updated to better reflect our evolving brand and mission. 1.11.0 08/15/2024 The "Random" menu item has been replaced with "Examples" for both the Minimum Spanning Tree and Dijkstra's algorithm presentations. Similar to the updates made previously for DFS and BFS, each of these sections now includes four predefined examples. This change fosters a more structured and illustrative learning experience, allowing for a clear demonstration of these algorithms on specific, consistent examples. 1.10.7 05/14/2024 1. Enhanced visual presentations for Bubble Sort, Selection Sort, Insertion Sort, and Quick Sort, including both Lomuto and Hoare partition schemes. Minor refinements have also been made to Merge Sort and Heap Sort to enhance learning engagement.
2. The code for all sorting algorithms has been improved for better readability. 1.10.6 05/07/2024 The presentations for Depth-First Search (DFS) and Breadth-First Search (BFS) graph traversal algorithms have been redesigned to enhance the learning experience. 1.10.5 03/31/2024 Expanded Hash Table Insights: The info dialog for the Hash Table topic now includes additional information, offering a deeper understanding of this data structure.
Revised Hash Table Code Example: The code example for the Hash Table has been revised to enhance understanding. 1.10.4 03/11/2024 Small UI Bug Fix 1.10.3 02/29/2024 1. Enhanced Information Dialogues: The info dialogues for Array, Linked List, Stack, and Queue have been updated with additional information.
2. Slide Navigation Indicator: For a better learning experience during slide-like presentations on Array, Linked List, Stack, and Queue, we've added a slide navigation indicator. This new feature displays the current slide number and the total number of slides, making it easier to track your progress through the material. 1.10.2 02/28/2024 We've updated the Home screen with a new look and feel to enhance your experience right from the start. 1.10.1 02/24/2024 1. Self-Balancing Trees Practice: Practice inserting and deleting nodes in AVL and Red-Black trees.
2. Redesigned Inserting and Deleting in Binary Search Trees: The topics on inserting and deleting in regular binary search trees have been completely redesigned for an improved learning experience. 1.10.0 02/11/2024 Fixed an issue affecting some users where the app might not unlock after purchase. 1.9.2 09/27/2023 You can now select a theme for the code, tailoring the appearance to your individual preference. 1.9.1 09/10/2023 1. Experience a complete redesign of the pre-order, in-order, post-order, and breadth-first binary tree traversals. Gain a deeper understanding of these traversals as you explore their workings in more detail.
2. Create custom binary trees using the new Binary Tree Constructor. Accessible from the menu, it allows you to experiment with different node values and structures. Please note that the Binary Tree Constructor is currently limited to use within the context of binary tree traversal algorithms. 1.9.0 06/29/2023 1. A new feature in the data structures section - Queue - has been introduced!
2. Expanding on the current materials, new content focusing on the double-ended linked list has been added.
3. Slight revisions have been made to the "Check the Code" for Array, Linked List, and Stack.
4. Information about how arrays are stored in memory has been added. 1.8.0 05/24/2023 1. Stack
2. DFS and BFS (simplified versions) have been removed from the "Graph Algorithms" section due to their redundancy
3. New Syntax Highlight 1.7.0 03/17/2023
VisiGrab: Learn to Code & DSA version 1.20.0
Updated At: 2026-07-23
Changes: Version History Added Min-Heap 1.20.0 22h ago Added end-of-topic quizzes for Array, Linked List, Doubly Linked List, Queue, and Stack — open one anytime from the menu 1.19.0 Jul 2 Added Doubly Linked List 1.18.0 Jun 29 Added C++ as a third programming language — view any topic's code in Java, Python, or C++. 1.17.0 Jun 13 • Added a "Slides" table of contents to Array, Linked List, Stack, and Queue presentations — tap any row to jump straight to that slide.
• These presentations now remember your last opened slide. Restart in the menu jumps back to the first slide. 1.16.0 Jun 7 Added Trie data structure with Insert, Delete, and StartsWith (Autocomplete) operations. 1.15.0 May 25 Added Topological Sort (Kahn's algorithm) with graph constructor integration. 1.14.0 May 6 Added Bellman-Ford to graph constructor 1.13.2 Apr 12 Improved value input widget across Sorting Algorithms and Graph Constructor 1.13.1 Apr 5 - Added Bellman-Ford algorithm
- Expanded Dijkstra info dialog
- Code section: Replit replaced with GitHub link 1.13.0 Mar 25 • Improved clarity of educational content
• Added 9 new languages: Portuguese (Brazil), Spanish (Latin America), German, French, Polish, Ukrainian, Korean, Japanese, and Simplified Chinese
• A brief Unity logo now appears at startup — we've moved to Unity's free tier. This helps us reduce development costs.
• New app icon & name 1.12.0 12/09/2025 1. Union-Find Data Structure: Now available to enhance understanding of network connectivity and related challenges.
2. Kruskal’s Algorithm: Newly added to provide a robust method for computing the Minimum Spanning Tree (MST) in weighted graphs.
3. Enhanced Algorithm Code: Refined code for DFS, BFS, Prim’s MST, and Dijkstra ensures more effective learning experiences.
4. New Look: Our app icon and name have been updated to better reflect our evolving brand and mission. 1.11.0 08/15/2024 The "Random" menu item has been replaced with "Examples" for both the Minimum Spanning Tree and Dijkstra's algorithm presentations. Similar to the updates made previously for DFS and BFS, each of these sections now includes four predefined examples. This change fosters a more structured and illustrative learning experience, allowing for a clear demonstration of these algorithms on specific, consistent examples. 1.10.7 05/14/2024 1. Enhanced visual presentations for Bubble Sort, Selection Sort, Insertion Sort, and Quick Sort, including both Lomuto and Hoare partition schemes. Minor refinements have also been made to Merge Sort and Heap Sort to enhance learning engagement.
2. The code for all sorting algorithms has been improved for better readability. 1.10.6 05/07/2024 The presentations for Depth-First Search (DFS) and Breadth-First Search (BFS) graph traversal algorithms have been redesigned to enhance the learning experience. 1.10.5 03/31/2024 Expanded Hash Table Insights: The info dialog for the Hash Table topic now includes additional information, offering a deeper understanding of this data structure.
Revised Hash Table Code Example: The code example for the Hash Table has been revised to enhance understanding. 1.10.4 03/11/2024 Small UI Bug Fix 1.10.3 02/29/2024 1. Enhanced Information Dialogues: The info dialogues for Array, Linked List, Stack, and Queue have been updated with additional information.
2. Slide Navigation Indicator: For a better learning experience during slide-like presentations on Array, Linked List, Stack, and Queue, we've added a slide navigation indicator. This new feature displays the current slide number and the total number of slides, making it easier to track your progress through the material. 1.10.2 02/28/2024 We've updated the Home screen with a new look and feel to enhance your experience right from the start. 1.10.1 02/24/2024 1. Self-Balancing Trees Practice: Practice inserting and deleting nodes in AVL and Red-Black trees.
2. Redesigned Inserting and Deleting in Binary Search Trees: The topics on inserting and deleting in regular binary search trees have been completely redesigned for an improved learning experience. 1.10.0 02/11/2024 Fixed an issue affecting some users where the app might not unlock after purchase. 1.9.2 09/27/2023 You can now select a theme for the code, tailoring the appearance to your individual preference. 1.9.1 09/10/2023 1. Experience a complete redesign of the pre-order, in-order, post-order, and breadth-first binary tree traversals. Gain a deeper understanding of these traversals as you explore their workings in more detail.
2. Create custom binary trees using the new Binary Tree Constructor. Accessible from the menu, it allows you to experiment with different node values and structures. Please note that the Binary Tree Constructor is currently limited to use within the context of binary tree traversal algorithms. 1.9.0 06/29/2023 1. A new feature in the data structures section - Queue - has been introduced!
2. Expanding on the current materials, new content focusing on the double-ended linked list has been added.
3. Slight revisions have been made to the "Check the Code" for Array, Linked List, and Stack.
4. Information about how arrays are stored in memory has been added. 1.8.0 05/24/2023 1. Stack
2. DFS and BFS (simplified versions) have been removed from the "Graph Algorithms" section due to their redundancy
3. New Syntax Highlight 1.7.0 03/17/2023
VisiGrab: Learn to Code & DSA version 1.18.0
Updated At: 2026-07-02
Changes: Version History Added Doubly Linked List 1.18.0 2d ago Added C++ as a third programming language — view any topic's code in Java, Python, or C++. 1.17.0 Jun 13 • Added a "Slides" table of contents to Array, Linked List, Stack, and Queue presentations — tap any row to jump straight to that slide.
• These presentations now remember your last opened slide. Restart in the menu jumps back to the first slide. 1.16.0 Jun 7 Added Trie data structure with Insert, Delete, and StartsWith (Autocomplete) operations. 1.15.0 May 25 Added Topological Sort (Kahn's algorithm) with graph constructor integration. 1.14.0 May 6 Added Bellman-Ford to graph constructor 1.13.2 Apr 12 Improved value input widget across Sorting Algorithms and Graph Constructor 1.13.1 Apr 5 - Added Bellman-Ford algorithm
- Expanded Dijkstra info dialog
- Code section: Replit replaced with GitHub link 1.13.0 Mar 25 • Improved clarity of educational content
• Added 9 new languages: Portuguese (Brazil), Spanish (Latin America), German, French, Polish, Ukrainian, Korean, Japanese, and Simplified Chinese
• A brief Unity logo now appears at startup — we've moved to Unity's free tier. This helps us reduce development costs.
• New app icon & name 1.12.0 12/09/2025 1. Union-Find Data Structure: Now available to enhance understanding of network connectivity and related challenges.
2. Kruskal’s Algorithm: Newly added to provide a robust method for computing the Minimum Spanning Tree (MST) in weighted graphs.
3. Enhanced Algorithm Code: Refined code for DFS, BFS, Prim’s MST, and Dijkstra ensures more effective learning experiences.
4. New Look: Our app icon and name have been updated to better reflect our evolving brand and mission. 1.11.0 08/15/2024 The "Random" menu item has been replaced with "Examples" for both the Minimum Spanning Tree and Dijkstra's algorithm presentations. Similar to the updates made previously for DFS and BFS, each of these sections now includes four predefined examples. This change fosters a more structured and illustrative learning experience, allowing for a clear demonstration of these algorithms on specific, consistent examples. 1.10.7 05/14/2024 1. Enhanced visual presentations for Bubble Sort, Selection Sort, Insertion Sort, and Quick Sort, including both Lomuto and Hoare partition schemes. Minor refinements have also been made to Merge Sort and Heap Sort to enhance learning engagement.
2. The code for all sorting algorithms has been improved for better readability. 1.10.6 05/07/2024 The presentations for Depth-First Search (DFS) and Breadth-First Search (BFS) graph traversal algorithms have been redesigned to enhance the learning experience. 1.10.5 03/31/2024 Expanded Hash Table Insights: The info dialog for the Hash Table topic now includes additional information, offering a deeper understanding of this data structure.
Revised Hash Table Code Example: The code example for the Hash Table has been revised to enhance understanding. 1.10.4 03/11/2024 Small UI Bug Fix 1.10.3 02/29/2024 1. Enhanced Information Dialogues: The info dialogues for Array, Linked List, Stack, and Queue have been updated with additional information.
2. Slide Navigation Indicator: For a better learning experience during slide-like presentations on Array, Linked List, Stack, and Queue, we've added a slide navigation indicator. This new feature displays the current slide number and the total number of slides, making it easier to track your progress through the material. 1.10.2 02/28/2024 We've updated the Home screen with a new look and feel to enhance your experience right from the start. 1.10.1 02/24/2024 1. Self-Balancing Trees Practice: Practice inserting and deleting nodes in AVL and Red-Black trees.
2. Redesigned Inserting and Deleting in Binary Search Trees: The topics on inserting and deleting in regular binary search trees have been completely redesigned for an improved learning experience. 1.10.0 02/11/2024 Fixed an issue affecting some users where the app might not unlock after purchase. 1.9.2 09/27/2023 You can now select a theme for the code, tailoring the appearance to your individual preference. 1.9.1 09/10/2023 1. Experience a complete redesign of the pre-order, in-order, post-order, and breadth-first binary tree traversals. Gain a deeper understanding of these traversals as you explore their workings in more detail.
2. Create custom binary trees using the new Binary Tree Constructor. Accessible from the menu, it allows you to experiment with different node values and structures. Please note that the Binary Tree Constructor is currently limited to use within the context of binary tree traversal algorithms. 1.9.0 06/29/2023 1. A new feature in the data structures section - Queue - has been introduced!
2. Expanding on the current materials, new content focusing on the double-ended linked list has been added.
3. Slight revisions have been made to the "Check the Code" for Array, Linked List, and Stack.
4. Information about how arrays are stored in memory has been added. 1.8.0 05/24/2023 1. Stack
2. DFS and BFS (simplified versions) have been removed from the "Graph Algorithms" section due to their redundancy
3. New Syntax Highlight 1.7.0 03/17/2023 Bug fixing related to purchase status 1.6.1 01/16/2023 1. Array
2. Linked list 1.6.0 01/16/2023
VisiGrab: Learn to Code & DSA version 1.17.0
Updated At: 2026-06-20
Changes: Version History Added C++ as a third programming language — view any topic's code in Java, Python, or C++. 1.17.0 6d ago • Added a "Slides" table of contents to Array, Linked List, Stack, and Queue presentations — tap any row to jump straight to that slide.
• These presentations now remember your last opened slide. Restart in the menu jumps back to the first slide. 1.16.0 Jun 7 Added Trie data structure with Insert, Delete, and StartsWith (Autocomplete) operations. 1.15.0 May 25 Added Topological Sort (Kahn's algorithm) with graph constructor integration. 1.14.0 May 6 Added Bellman-Ford to graph constructor 1.13.2 Apr 12 Improved value input widget across Sorting Algorithms and Graph Constructor 1.13.1 Apr 5 - Added Bellman-Ford algorithm
- Expanded Dijkstra info dialog
- Code section: Replit replaced with GitHub link 1.13.0 Mar 25 • Improved clarity of educational content
• Added 9 new languages: Portuguese (Brazil), Spanish (Latin America), German, French, Polish, Ukrainian, Korean, Japanese, and Simplified Chinese
• A brief Unity logo now appears at startup — we've moved to Unity's free tier. This helps us reduce development costs.
• New app icon & name 1.12.0 12/09/2025 1. Union-Find Data Structure: Now available to enhance understanding of network connectivity and related challenges.
2. Kruskal’s Algorithm: Newly added to provide a robust method for computing the Minimum Spanning Tree (MST) in weighted graphs.
3. Enhanced Algorithm Code: Refined code for DFS, BFS, Prim’s MST, and Dijkstra ensures more effective learning experiences.
4. New Look: Our app icon and name have been updated to better reflect our evolving brand and mission. 1.11.0 08/15/2024 The "Random" menu item has been replaced with "Examples" for both the Minimum Spanning Tree and Dijkstra's algorithm presentations. Similar to the updates made previously for DFS and BFS, each of these sections now includes four predefined examples. This change fosters a more structured and illustrative learning experience, allowing for a clear demonstration of these algorithms on specific, consistent examples. 1.10.7 05/14/2024 1. Enhanced visual presentations for Bubble Sort, Selection Sort, Insertion Sort, and Quick Sort, including both Lomuto and Hoare partition schemes. Minor refinements have also been made to Merge Sort and Heap Sort to enhance learning engagement.
2. The code for all sorting algorithms has been improved for better readability. 1.10.6 05/07/2024 The presentations for Depth-First Search (DFS) and Breadth-First Search (BFS) graph traversal algorithms have been redesigned to enhance the learning experience. 1.10.5 03/31/2024 Expanded Hash Table Insights: The info dialog for the Hash Table topic now includes additional information, offering a deeper understanding of this data structure.
Revised Hash Table Code Example: The code example for the Hash Table has been revised to enhance understanding. 1.10.4 03/11/2024 Small UI Bug Fix 1.10.3 02/29/2024 1. Enhanced Information Dialogues: The info dialogues for Array, Linked List, Stack, and Queue have been updated with additional information.
2. Slide Navigation Indicator: For a better learning experience during slide-like presentations on Array, Linked List, Stack, and Queue, we've added a slide navigation indicator. This new feature displays the current slide number and the total number of slides, making it easier to track your progress through the material. 1.10.2 02/28/2024 We've updated the Home screen with a new look and feel to enhance your experience right from the start. 1.10.1 02/24/2024 1. Self-Balancing Trees Practice: Practice inserting and deleting nodes in AVL and Red-Black trees.
2. Redesigned Inserting and Deleting in Binary Search Trees: The topics on inserting and deleting in regular binary search trees have been completely redesigned for an improved learning experience. 1.10.0 02/11/2024 Fixed an issue affecting some users where the app might not unlock after purchase. 1.9.2 09/27/2023 You can now select a theme for the code, tailoring the appearance to your individual preference. 1.9.1 09/10/2023 1. Experience a complete redesign of the pre-order, in-order, post-order, and breadth-first binary tree traversals. Gain a deeper understanding of these traversals as you explore their workings in more detail.
2. Create custom binary trees using the new Binary Tree Constructor. Accessible from the menu, it allows you to experiment with different node values and structures. Please note that the Binary Tree Constructor is currently limited to use within the context of binary tree traversal algorithms. 1.9.0 06/29/2023 1. A new feature in the data structures section - Queue - has been introduced!
2. Expanding on the current materials, new content focusing on the double-ended linked list has been added.
3. Slight revisions have been made to the "Check the Code" for Array, Linked List, and Stack.
4. Information about how arrays are stored in memory has been added. 1.8.0 05/24/2023 1. Stack
2. DFS and BFS (simplified versions) have been removed from the "Graph Algorithms" section due to their redundancy
3. New Syntax Highlight 1.7.0 03/17/2023 Bug fixing related to purchase status 1.6.1 01/16/2023 1. Array
2. Linked list 1.6.0 01/16/2023 1. Application is adapted for iPads
2. The code of algorithms can now also be viewed in Python
3. The presentation of inserting a node into BST is improved
4. The dialog responsible for creating a custom array (see sorting algorithms) is added
5. Now you can view a summary of the algorithm by clicking on the "i" button that has been added to the top bar
6. The name of the app is changed again
7. Bug fix 1.5.0 04/04/2022
VisiGrab: Learn to Code & DSA version 1.14.0
Updated At: 2026-05-18
Changes: Version History Added Topological Sort (Kahn's algorithm) with graph constructor integration. 1.14.0 May 6 Added Bellman-Ford to graph constructor 1.13.2 Apr 12 Improved value input widget across Sorting Algorithms and Graph Constructor 1.13.1 Apr 5 - Added Bellman-Ford algorithm
- Expanded Dijkstra info dialog
- Code section: Replit replaced with GitHub link 1.13.0 Mar 25 • Improved clarity of educational content
• Added 9 new languages: Portuguese (Brazil), Spanish (Latin America), German, French, Polish, Ukrainian, Korean, Japanese, and Simplified Chinese
• A brief Unity logo now appears at startup — we've moved to Unity's free tier. This helps us reduce development costs.
• New app icon & name 1.12.0 12/09/2025 1. Union-Find Data Structure: Now available to enhance understanding of network connectivity and related challenges.
2. Kruskal’s Algorithm: Newly added to provide a robust method for computing the Minimum Spanning Tree (MST) in weighted graphs.
3. Enhanced Algorithm Code: Refined code for DFS, BFS, Prim’s MST, and Dijkstra ensures more effective learning experiences.
4. New Look: Our app icon and name have been updated to better reflect our evolving brand and mission. 1.11.0 08/15/2024 The "Random" menu item has been replaced with "Examples" for both the Minimum Spanning Tree and Dijkstra's algorithm presentations. Similar to the updates made previously for DFS and BFS, each of these sections now includes four predefined examples. This change fosters a more structured and illustrative learning experience, allowing for a clear demonstration of these algorithms on specific, consistent examples. 1.10.7 05/14/2024 1. Enhanced visual presentations for Bubble Sort, Selection Sort, Insertion Sort, and Quick Sort, including both Lomuto and Hoare partition schemes. Minor refinements have also been made to Merge Sort and Heap Sort to enhance learning engagement.
2. The code for all sorting algorithms has been improved for better readability. 1.10.6 05/07/2024 The presentations for Depth-First Search (DFS) and Breadth-First Search (BFS) graph traversal algorithms have been redesigned to enhance the learning experience. 1.10.5 03/31/2024 Expanded Hash Table Insights: The info dialog for the Hash Table topic now includes additional information, offering a deeper understanding of this data structure.
Revised Hash Table Code Example: The code example for the Hash Table has been revised to enhance understanding. 1.10.4 03/11/2024 Small UI Bug Fix 1.10.3 02/29/2024 1. Enhanced Information Dialogues: The info dialogues for Array, Linked List, Stack, and Queue have been updated with additional information.
2. Slide Navigation Indicator: For a better learning experience during slide-like presentations on Array, Linked List, Stack, and Queue, we've added a slide navigation indicator. This new feature displays the current slide number and the total number of slides, making it easier to track your progress through the material. 1.10.2 02/28/2024 We've updated the Home screen with a new look and feel to enhance your experience right from the start. 1.10.1 02/24/2024 1. Self-Balancing Trees Practice: Practice inserting and deleting nodes in AVL and Red-Black trees.
2. Redesigned Inserting and Deleting in Binary Search Trees: The topics on inserting and deleting in regular binary search trees have been completely redesigned for an improved learning experience. 1.10.0 02/11/2024 Fixed an issue affecting some users where the app might not unlock after purchase. 1.9.2 09/27/2023 You can now select a theme for the code, tailoring the appearance to your individual preference. 1.9.1 09/10/2023 1. Experience a complete redesign of the pre-order, in-order, post-order, and breadth-first binary tree traversals. Gain a deeper understanding of these traversals as you explore their workings in more detail.
2. Create custom binary trees using the new Binary Tree Constructor. Accessible from the menu, it allows you to experiment with different node values and structures. Please note that the Binary Tree Constructor is currently limited to use within the context of binary tree traversal algorithms. 1.9.0 06/29/2023 1. A new feature in the data structures section - Queue - has been introduced!
2. Expanding on the current materials, new content focusing on the double-ended linked list has been added.
3. Slight revisions have been made to the "Check the Code" for Array, Linked List, and Stack.
4. Information about how arrays are stored in memory has been added. 1.8.0 05/24/2023 1. Stack
2. DFS and BFS (simplified versions) have been removed from the "Graph Algorithms" section due to their redundancy
3. New Syntax Highlight 1.7.0 03/17/2023 Bug fixing related to purchase status 1.6.1 01/16/2023 1. Array
2. Linked list 1.6.0 01/16/2023 1. Application is adapted for iPads
2. The code of algorithms can now also be viewed in Python
3. The presentation of inserting a node into BST is improved
4. The dialog responsible for creating a custom array (see sorting algorithms) is added
5. Now you can view a summary of the algorithm by clicking on the "i" button that has been added to the top bar
6. The name of the app is changed again
7. Bug fix 1.5.0 04/04/2022 1. You can create your own graph and apply it to Depth-first search, Breadth-first search, Minimum Spanning Tree and Dijkstra's algorithm
2. The traversal lines have been changed. Now, these lines are dashed. Affected algorithms: DFS, BFS, pre-order, in-order, post-order, and breadth-first traversals 1.4.0 08/01/2021 Minimum Spanning Tree 1.3.0 06/03/2021 Dijkstra'a algorithm 1.2.0 05/03/2021
VisiGrab: Learn to Code & DSA version 1.12.0
Updated At: 2025-12-09
Changes: • Improved clarity of educational content
• Added 9 new languages: Portuguese (Brazil), Spanish (Latin America), German, French, Polish, Ukrainian, Korean, Japanese, and Simplified Chinese
• A brief Unity logo now appears at startup — we've moved to Unity's free tier. This helps us reduce development costs.
• New app icon & name
