Engineering — Software Developer

Why settle for an uninspiring job when you can work in a technology driven company that continually innovates and is building a successful business. Cyan is a leading supplier of purpose built, next-generation packet optical transport platforms with transformational network scale and multi-layer management. We are a leading supplier of hardware, software and innovative services, creating game changing solutions making major impacts on networks in our customers' business models.

Cyan has a growing world-wide customer base. Cyan has been ranked sixth by the Wall Street Journal as one of the top 50 venture-backed companies and was listed among the top 3 companies in the information technology sector. Cyan is founded and lead by a team of industry veterans with a track record of successful innovation.  

SOFTWARE DEVELOPER
As an application software developer at Cyan, you work in an agile development environment and thus are enabled to make an immediate contribution to our products and customers. Newly developed features could be released to a live production site in a matter of days. We are looking for smart people to solve hard problems. You will handle a wide array of tasks ranging from prototyping new techniques and technologies, to developing test automation, and supporting our growing customer base. You are expected to write quality code with high availability for large-scale applications in a Carrier-Class networking environment. You will have the opportunity to work with some newer technologies including Python/Django, Graph/NoSQL Databases, Google Web Toolkit (GWT) and HTML5. 
 
EXPERIENCE / SKILLS DESIRED
Cyan is looking to hire numerous developers with varying experience levels. Please apply if you satisfy most of the following:
  • Ability to interface with customers
  • Ability to write programs in dynamic and static language
  • Understanding of database models
  • Understanding of web
PROBLEM SOLVING
All interested candidates should submit their resume along with the solution to the problem outlined below:
 
Graph Traversal
Given a graph based on a set of nodes and links, write a program that shows all the possible paths from 2 distinct nodes. It is up to you to decide what kind of structure you want to use to represent the nodes and links.
 
Example:
 
Let's say there are 4 nodes, named as 'a', 'b', 'c', 'd'.
And there are 4 links that connect 'a & b', 'b & d', 'a & c', and 'c & d', so that it will form a graph like the following:
 
  ---- b ----
a             d
  ---- c ----
  
If the source is 'a', and the destination is 'd', your program should return:
 
a - b - d
a - c - d
 
If you think there are some ambiguities here, please let us know.