Skip to contentSkip to footer

Software Engineer Ruby Interview Questions

Salaries
Interviews

666,129 software engineer ruby interview questions shared by candidates

Problem Statement : 18 Ralway Stations from Tamil Nadu are given. A passenger need ticket. Upto the 5 stations journey, fare is 10 Rs. After the 5 stations, for every 5 stations, 5 Rs extra will be charged. For the full stretch journey i.e. From 1st to the last station, fare is 20 Rs. Input 1 : StationFrom - Guindy, StationTo - Kadambakkam Output 1 : Print ticket. i.e. StationFrom : Guindy, StationTo : Kadambakkam, Total Stops : 3, Total Fare : 10 Input 2 : StationFrom - Guindy , StationTo - Chennai Fort Output 2 : Print ticket. i.e. StationFrom : Guindy, StationTo : Chennai Fort, Total Stops : 8, Total Fare :15 Code should follow design principles, patterns. Test Driven Development would be preferable, not mandatory though.
avatar

Software Developer

Interviewed at Thoughtworks

4★
Aug 28, 2015

Problem Statement : 18 Ralway Stations from Tamil Nadu are given. A passenger need ticket. Upto the 5 stations journey, fare is 10 Rs. After the 5 stations, for every 5 stations, 5 Rs extra will be charged. For the full stretch journey i.e. From 1st to the last station, fare is 20 Rs. Input 1 : StationFrom - Guindy, StationTo - Kadambakkam Output 1 : Print ticket. i.e. StationFrom : Guindy, StationTo : Kadambakkam, Total Stops : 3, Total Fare : 10 Input 2 : StationFrom - Guindy , StationTo - Chennai Fort Output 2 : Print ticket. i.e. StationFrom : Guindy, StationTo : Chennai Fort, Total Stops : 8, Total Fare :15 Code should follow design principles, patterns. Test Driven Development would be preferable, not mandatory though.

You have an array randomly filled with red, blue and green items. How do you order this list so the red items are at the beginning, followed by the blue ones, followed by the green ones? The algorithm should be in-place (no extra storage, or only constant extra storage) and the algorithm should only walk threw the array once (every position can only be read once).
avatar

Programmer

Interviewed at IG Group

2.9★
Feb 27, 2010

You have an array randomly filled with red, blue and green items. How do you order this list so the red items are at the beginning, followed by the blue ones, followed by the green ones? The algorithm should be in-place (no extra storage, or only constant extra storage) and the algorithm should only walk threw the array once (every position can only be read once).

Viewing 1221 - 1230 interview questions

Glassdoor has 666,129 interview questions and reports from Software engineer ruby interviews. Prepare for your interview. Get hired. Love your job.