Participate, Learn, Solve and Be Part of Exzeo
Any one of the below problems can be chosen to participate. Developers can write a simple Console Application to showcase the solutions
public interface IContract
{
void Func1();
void Func2();
}
/// <remarks>
/// Class is implementing Contarct "IContract"
/// This class represent the concrete implementation of one the client C1
/// requirement
/// </remarks>
public class ConcreteImplementation1 : IContract
{
public void Func1()
{
//..... Do something......
}
public void Func2()
{
//..... Do something......
}
}
/// <remarks>
/// Class is implementing Contarct "IContract"
/// This class represent the concrete implementation of one the client C2
/// requirement
/// </remarks>
public class ConcreteImplementation2 : IContract
{
public void Func1()
{
//..... Do something......
}
public void Func2()
{
//..... Do something......
}
}Please carefully read above code where a real life problem has been described. In above scenario, a Contract has been followed by two of the Client and both Contract has something to achieve. Now after some time out of 2 client, one of the client want to have one more addition within his Contract.
How from you code you will facilitate "Client 2" request to add "Func3" without affecting "Client 1"?
Please look at the image carefully which describe scenario as follows:
- All the stations
- Distance between station has been mentioned in the Image itself
- There are N vehicles which can be treated as Client. Each client would be initialized as follows:
- C(i, s, d) where "C" is client as vehicle, "i" is Initial Station, "s" is speed of vehicle and "d" is direction(from starting station -> to next station)
- i<>d where Initial station should not be same
- When destination is reached, Vehicle is considered to be Parked
- All clients would be initialized and will send signal to Server at constant duration say after every 1km
- Server will be having information and should show the status of client as follows:
- Status of particular client as Moving or Parked
- Status of Station as which as all client is near to particular station(Optional for Solution)
For simplicity:
- Speed can be considered as constant of all client
- It can be considered that all client are travelling in same direction
- "N" that is number of Client can be considered as 4
- Initialize your client based on the scenario explained above. All client should talk to Server
All participant should write clients and server and showcase this scenario. A simple Console Application as Server and Client can be created.
You can use third party libraries too for your solution.
Please look at the image carefully which describe scenario as follows:
- Chance is with White pieces
- There is a possibility of checkmate in one move :) let's see if you can find this out or not !!!. And this is checkmate move.
- If user select any other any other move, system should show "Winning possibility is not 100%". If user select Checkmate move then system show "Winning possibility is 100% with checkmate".
- Design the Chess board on your web page
- Build a client-side plugin which can support Chess board in a following manner:
- Valid movements should be supported with all kind of pieces
- With reference of above problem, White should move and achieve Checkmate
- Web page should show alert if Checkmate is not possible. "Winning possibility is not 100%"
- Black movement is prohibited since chance is with White pieces
Problem is as defined:
- Get all Tweets for particular Topic on your custom web page
- Page should simulate the real time behaviour
- Page should have a Textbox which can take Topic as input and will act as feed to the your web page.
- Be creative in your design
- Get the followers of searched Topic and show them on your page
Reference:
Problem is as defined:
- Take reference of dictionary files from repository itself
- Read this file into your program. It can be a Web Page or a Console application
- If it is a web page then it should have a Textbox which can take a random or genuine word string as input
- Using above input you have to find how many perfect(same length of input string) or imperfect(anagram length is less than length of input string) Anagrams are possible.
- List all the anagram
For example, word "Swathe" from dictionary has following anagrams:
Swath, Wheat, Sweat, Hates, Heats, Thaws, Haste, Waste, Whets, Wast, Wash, Awes, West, Thaw, Teas, Heat, What, Whet, Swat, Stew, East, Haws, Hats, Seat, Eats, Hews, Sate, Wets, Hast, Hate, Saw ,Set, Wet, Tea, Haw, Hew, Sat, The, Hat,Ate, Sew,Has, Eat, Was, Awe, Sea, Ash, She, Ha, Eh, We,At, He, As, Ah, A
Point to remember:
- Choose your data structure wisely so that you can achieve maximum performance while searching the dictionary
- Go back to school and find out best algorithm to achieve the searching and which complement your data structure
- Fork the repository from your GitHub account.
- Push the code related to solution into Forked repository. You can also let us know through email:adityap@exzeo.com once you are done with your solution. We can send the feedback that is personal to you only. In order to do so you have to write us an email saying "Send me feedback on my email ".

