Market US
AppCorpus
Market US

VisiGrab: Algorithms & DSA

by Ievgen Ovsii

iPhone · iPad

Active Last checked 6 Aug 2026

App Store ↗

Quick verdict

What it is
Store information collected; independent summary not yet available.
At a glance
  • Free to download
  • In-app purchases

Categories and search queries

Official categories

AppCorpus categories

Key functions

Function Availability Access Scope Evidence
Free app Yes Free — Store published
In-app purchases Yes Limited free — Store published

Screens

App Store

14 store screenshots

VisiGrab: Algorithms & DSA ipad screenshot 1
VisiGrab: Algorithms & DSA ipad screenshot 2
VisiGrab: Algorithms & DSA ipad screenshot 3
VisiGrab: Algorithms & DSA ipad screenshot 4

Pricing & paywalls

App Store

  • Lifetime Access — All Content — $6.99

Last verified 6 Aug 2026

Ratings & reviews

App Store

4.8 74 ratings · App Store

  1. 3/5purchase but didn’t unlock

    please fix!

    Jgc846 · 6 Aug 2026

  2. 5/5Highly Recommended

    I highly recommend this application to those seeking to either newly learn or reinforce their understanding of fundamental data structures. Designer(s) show deep understanding of data structures through the illustrations and their backing program codes. They provide quality updates and improvements to the application as well which I have seen over the time. Top notch and inspiring, keep up the good work!

    Solid Dragon · 6 Aug 2026

  3. 5/5Do you have this in python?

    Python?

    Roadbag · 6 Aug 2026

  4. 5/5Best iOS app for DSA!

    This is a great app to watch and learn algorithms in detailed simulation along with its pseudo code! Amazing app, but it’d be great if the storage space could’ve been optimised. 200-300mb app is kinda big for a 16gb iPhone here 😔

    BlasterOverlord · 6 Aug 2026

  5. 4/5Please make a way for users to mark items complete

    Nice study tool. Would be better if we could mark sections understood as we move through sections to make it easier to navigate.

    Thereader23 · 6 Aug 2026

Privacy & accessibility

App Store

Privacy

  • Data Linked to You — Analytics — Diagnostics — Crash Data Developer declared
  • Data Linked to You — Analytics — Diagnostics — Other Diagnostic Data Developer declared
  • Data Linked to You — Analytics — Diagnostics — Performance Data Developer declared
  • Data Linked to You — Analytics — Identifiers — Device ID Developer declared
  • Data Linked to You — Analytics — Identifiers — User ID Developer declared
  • Data Linked to You — Analytics — Location — Coarse Location Developer declared
  • Data Linked to You — Analytics — Other Data — Other Data Types Developer declared
  • Data Linked to You — Analytics — Purchases — Purchase History Developer declared
  • Data Linked to You — Analytics — Usage Data — Product Interaction Developer declared
  • Data Linked to You — Analytics — User Content — Customer Support Developer declared
  • Data Linked to You — App Functionality — Other Data — Other Data Types Developer declared
  • Data Linked to You — App Functionality — Purchases — Purchase History Developer declared
  • Data Linked to You — Other Purposes — Diagnostics — Crash Data Developer declared
  • Data Linked to You — Other Purposes — Diagnostics — Performance Data Developer declared
  • Data Linked to You — Other Purposes — User Content — Customer Support Developer declared
  • Data Linked to You — Product Personalization — Identifiers — Device ID Developer declared
  • Data Linked to You — Product Personalization — Identifiers — User ID Developer declared
  • Data Linked to You — Diagnostics Developer declared
  • Data Linked to You — Identifiers Developer declared
  • Data Linked to You — Location Developer declared
  • Data Linked to You — Other Data Developer declared
  • Data Linked to You — Purchases Developer declared
  • Data Linked to You — Usage Data Developer declared
  • Data Linked to You — User Content Developer declared

Accessibility

No accessibility labels collected yet.

Versions

App Store

  • 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.

  • 1.10.1

    We've updated the Home screen with a new look and feel to enhance your experience right from the start.

  • 1.10.2

    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.3

    Small UI Bug Fix

  • 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.

  • 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.

  • 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.

  • 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.

  • 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.

  • 1.12.0

    • 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.13.0

    - Added Bellman-Ford algorithm - Expanded Dijkstra info dialog - Code section: Replit replaced with GitHub link

  • 1.13.1

    Improved value input widget across Sorting Algorithms and Graph Constructor

  • 1.13.2

    Added Bellman-Ford to graph constructor

  • 1.14.0

    Added Topological Sort (Kahn's algorithm) with graph constructor integration.

  • 1.15.0

    Added Trie data structure with Insert, Delete, and StartsWith (Autocomplete) operations.

  • 1.16.0

    • 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.17.0

    Added C++ as a third programming language — view any topic's code in Java, Python, or C++.

  • 1.18.0

    Added Doubly Linked List

  • 1.19.0

    Added end-of-topic quizzes for Array, Linked List, Doubly Linked List, Queue, and Stack — open one anytime from the menu

  • 1.20.0 · 22 Jul 2026

    Added Min-Heap

  • 1.7.0

    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.8.0

    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.9.0

    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.1

    You can now select a theme for the code, tailoring the appearance to your individual preference.

  • 1.9.2

    Fixed an issue affecting some users where the app might not unlock after purchase.

Alternatives

Availability by market

Data quality & evidence

Page completeness
Live store listing
Last verified
6 Aug 2026
Sources
App Store

Report a correction