• Are you looking for a new job in tech industry but don't know how to prepare for Java coding/programming interview questions?
• Would you like to improve your algorithm and data structures problem solving skills as a software engineer?
• Do you have very little time to learn various algorithm problems?
• Are you afraid of forgetting the coding/programming interview questions and answers you have learnt previously?
APAS is here to help!
What is APAS?
APAS is short for algorithm problems and solutions. This coding/programming interview app helps you access and learn interview questions offline on an Android device anywhere anytime!
Currently it features algorithms and data structures interview problems from Leetcode. You can grasp how to answer Java coding interview questions easily with this APP as long as you know some Java basics!
❤️ More than 400 most common Leetcode coding/programming interview questions on algorithms, data structures, and even system designs!
❤️ Each Leetcode algorithms and data structures problem has a clean, detailed problem description and one or more Java solutions!
❤️ Each solution is syntax-highlighted with line number, and can expand to full screen!
❤️ You can also mark a problem and read it later!
❤️ You can also take notes of a problem!
❤️ You are able to search any Leetcode problem quickly with its name or id!
❤️ Problems are categorized by different levels or various topics!
❤️ Dark theme support for less battery usage and long time reading at night!
❤️ One simple switch to turn on offline mode so that you are totally free from network!
All Java solutions are based on this popular Github repo that has close to 1500 stars! https://github.com/FreeTymeKiyan/LeetCode-Sol-Res
Some of the solutions are also available in python or c++!
If you have any feedbacks, please comment or send an email in the app or to email@example.com . I will get back to you and address the issues ASAP.
A list of data structures covered
• Hash Table
• Linked List
• Binary Indexed Tree
• Segment Tree
• Binary Search Tree
• Union Find
A list of algorithms covered
• Binary Search
• Divide and Conquer
• Dynamic Programming
• Topological Sort
• Breadth-first Search
• Depth-first Search
• Reservoir Sampling
• Rejection Sampling
• Two pointers
• Bit Operations