A Trie is a tree like data structure used for storing words in a way which facilitates fast look-ups. They prove very useful for handling dictionaries. In Part 1 we defined the trie data structure and started outlining the code for it. In this articles we are going to take a look at the basic operation we can do on a trie: Insert, Query…
Introducing ARKit
Apple has just released an augmented reality (AR) framework. This will allow millions of app developers to make AR experiences on iOS for hundreds of millions of devices – making ARKit + iOS the biggest AR platform. Even Pokemon GO will use it. Visual Inertial Odometry The magic that powers ARKit is called Visual Inertial Odometry – VIO from now on. It uses VIO to…
Working with the Trie data structure: Part 3
A Trie is a tree like data structure used for storing words in a way which facilitates fast look-ups. They prove very useful for handling dictionaries. In Part 1 we defined the trie data structure and started outlining the code for it. In this articles we are going to take a look at the basic operation we can do on a trie: Insert, Query…
WWDC 2017
WWDC is Apple’s annual Worldwide Developers Conference, a great chance for all developers around the world to meet the best engineers from Apple and to get the latest insights about their favorite products and latest technologies. It’s a great event where you can learn new things from valuable workshops, hands-on labs, software sessions, thematic meetings and many more special events.…
Advanced Firebase For The Win
Introduction With Firebase 101 we introduced the basic features of firebase and most of it’s database features. With this tutorial, we’re continuing the presentation of Firebase with some more advanced topics: Authentication: In most apps, some data needs to be restricted to certain users. A user may want to share information with his friends, but may not like to have…
Let companies apply for you!
Indeed Prime helps tech workers simplify their job search and land their dream job by turning the process around and giving them full control in picking the companies they’d like to engage with. It’s a fast track for in-demand knowledge workers to their dream career. Meet Great Companies Candidates get immediate exposure to the best tech companies with just one…
Working with the Trie data structure: Part 2
A Trie is a tree like data structure used for storing words in a way which facilitates fast look-ups. They prove very useful for handling dictionaries. In Part 1 we defined the trie data structure and started outlining the code for it. In this articles we are going to take a look at the basic operation we can do on a trie: Insert, Query…
TapWar
In this tutorial you’ll learn to make a simple iOS game using the most basic components: UIView, UILabel, UITapGestureRecognizer. You can do it really quick and the result will impress all of your friends. So, let’s start! Tap War Our game involves two players: red and green. When a player taps his part of the screen it will grow a…
1 Application to 100 Tech Companies
Indeed Prime helps tech workers simplify their job search and land their dream job by turning the process around and giving them full control in picking the companies they’d like to engage with. It’s a fast track for in-demand knowledge workers to their dream career. Meet Great Companies Candidates get immediate exposure to the best tech companies with just one…
Working with the Trie data structure: Part 1
Consider the need to use a dictionary. You will have to insert , look-up , remove words to and from it. What data structure would you use ? Would you use a hash table ? Would that be efficient in terms of memory? Perhaps not. A Trie is a tree like data structure used for storing words in a way…
