learningto/pass - Google Interview Prep, Visually

Google L4-L6 Prep16 TopicsLearning to passthe interviewStructured prep covering the data structures and algorithms big-tech interviews expect. Interactive visualizations, a Python playground, AI-powered feedback, and progress tracking.Google Interview Readiness0Just StartingStart practicing to build your scoreTry it now - no signupTwo Sum · easySolve a real Google interview question, right hereGiven an array of integers `nums` and an integer `target`, return the indices of the two numbers that add up to `target`. Each input has exactly one solution. You may not use the same element twice.Time:O(n)Space:O(n)Real Python, real tests - it all runs in your browser.solution.py⌘↵ runOUTPUTRun your code to see outputNot sure where to start?Follow the skill tree - learn concepts in the right order with prerequisites mapped out.View Learning Path0/16Topics Mastered0Challenges Solved0Active This WeekData Structures8 topics0% avg masteryBeginnerArrays & Stringsavg O(n)space O(1)Mastery0%0/3 challengesEasyLinked Listsavg O(n)space O(1)Mastery0%0/2 challengesEasyStacks & Queuesavg O(1)space O(n)Mastery0%0/2 challengesEasyHash Tablesavg O(1)space O(n)Mastery0%0/2 challengesIntermediateBinary Treesavg O(log n)space O(h)Mastery0%0/2 challengesAdvancedGraphsavg O(V + E)space O(V + E)Mastery0%0/2 challengesIntermediateHeaps / Priority Queuesavg O(log n)space O(n)Mastery0%0/1 challengesAdvancedTriesavg O(m)space O(n * m)Mastery0%0/1 challengesAlgorithms6 topics0% avg masteryEasySortingavg O(n log n)space O(log n)Mastery0%0/1 challengesEasyBinary Searchavg O(log n)space O(1)Mastery0%0/2 challengesIntermediateRecursion & Backtrackingavg O(2^n)space O(n)Mastery0%0/1 challengesExpertDynamic Programmingavg O(n^2)space O(n)Mastery0%0/2 challengesIntermediateBFS & DFSavg O(V + E)space O(V)Mastery0%0/1 challengesIntermediateGreedy Algorithmsavg O(n log n)space O(1)Mastery0%0/1 challengesConcepts2 topics0% avg masteryBeginnerBig-O Notationavg N/Aspace N/AMastery0%0/1 challengesAdvancedSystem Design Basicsavg O(1)space O(n)Mastery0%0/1 challenges