About VisiGrab: Algorithms & DSA
Searching for the perfect DSA companion? Look no further! VisiGrab is your interactive, visual guide to mastering algorithms and data structures - transforming complex concepts into intuitive, easy-to-understand...
Searching for the perfect DSA companion? Look no further! VisiGrab is your interactive, visual guide to mastering algorithms and data structures - transforming complex concepts into intuitive, easy-to-understand experiences. Ace your next technical interview and level up your coding skills with our comprehensive learning platform. Visualize & Conquer DSA Tired of dry textbooks and confusing lectures? VisiGrab brings algorithms and data structures to life with dynamic visualizations. Watch algorithms unfold step-by-step, manipulate data interactively, and gain a deep, intuitive understanding of core DSA principles. Learn faster, retain more, and finally grasp those tricky concepts. Comprehensive DSA Coverage From fundamentals to advanced topics, VisiGrab has you covered: . Sorting: Bubble, Selection, Insertion, Quick, Merge, Heap . Data Structures: Arrays, Linked Lists, Stacks, Queues, Hash Tables, Trees, Graphs . Advanced Concepts: AVL Trees, Red-Black Trees, BFS, DFS, Dijkstra, Bellman-Ford, Minimum Spanning Trees (Prim & Kruskal), Union-Find . Graph Constructor: Build and visualize your own graphs interactively . Code Examples: Explore real implementations in Python and Java - C++ coming soon. Full source code available on GitHub Perfect for DSA Mastery Whether you're a computer science student preparing for campus placement, a self-taught developer getting ready for tech interviews, or an experienced programmer brushing up on DSA concepts, VisiGrab is your essential learning tool. Sharpen your problem-solving skills and build a solid foundation in algorithms and data structures. Ideal for LeetCode practice, competitive programming, and CS exam study. Why Choose VisiGrab? . Interactive Visualizations: Learn through hands-on exploration . Gamified Learning: Stay engaged and motivated with a gaming-inspired design . Offline Access: Study anytime, anywhere - no internet required . Available in 10 Languages: English, German, French, Spanish, Portuguese, Polish, Ukrainian, Japanese, Korean, and Chinese (Simplified) . Lifetime Access: One-time purchase - no subscriptions, no ads, no recurring fees Master DSA concepts and excel in your coding interviews. Download VisiGrab today and unlock your full programming potential!
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
Previous Versions
Here you can find the changelog of VisiGrab: Algorithms & DSA since it was posted on our website on 2023-05-24 06:43:38.
The latest version is 1.17.0 and it was updated on 2026-06-20 23:27:39. See below the changes in each version.
VisiGrab: Algorithms & 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: Algorithms & 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: Algorithms & 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
VisiGrab: Algorithms & DSA version 1.11.0
Updated At: 2024-08-15
Changes: Aug 15, 2024
Version 1.11.0
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.
VisiGrab: Algorithms & DSA version 1.10.7
Updated At: 2024-05-14
Changes: May 14, 2024
Version 1.10.7
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.
VisiGrab: Algorithms & DSA version 1.10.6
Updated At: 2024-05-07
Changes: May 7, 2024
Version 1.10.6
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.
VisiGrab: Algorithms & DSA version 1.10.5
Updated At: 2024-03-31
Changes: Mar 31, 2024
Version 1.10.5
The presentations for Depth-First Search (DFS) and Breadth-First Search (BFS) graph traversal algorithms have been redesigned to enhance the learning experience.
VisiGrab: Algorithms & DSA version 1.10.4
Updated At: 2024-03-11
Changes: Mar 11, 2024
Version 1.10.4
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.
VisiGrab: Algorithms & DSA version 1.10.3
Updated At: 2024-02-29
Changes: Feb 29, 2024
Version 1.10.3
Small UI Bug Fix
VisiGrab: Algorithms & DSA version 1.10.0
Updated At: 2024-02-11
Changes: Feb 11, 2024
Version 1.10.0
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.
Disclaimer
Official App Store Link
We do not host VisiGrab: Algorithms & DSA on our servers. We did not scan it for viruses, adware, spyware or other type of malware. This app is hosted by Apple and passed their terms and conditions to be listed there. We recommend caution when installing it.
The App Store link for VisiGrab: Algorithms & DSA is provided to you by apps112.com without any warranties, representations or guarantees of any kind, so access it at your own risk.
If you have questions regarding this particular app contact the publisher directly. For questions about the functionalities of apps112.com contact us.
