Cirrus Logic OA 2019

匿名1251 · 2019 年9 月 22 日 21:24

Q1 - FizzBuzz

Q2 - Word/Stack Machine

motyim/ProblemSolve/blob/master/src/main/java/me/motyim/codility/StackProblem.java

package me.motyim.codility;

import java.util.Stack;

/**
 * @author MotYim <mohamed.motyim@gmail.com>
 * @since 19-Oct-17
 */
public class StackProblem {


    public int solution(String S){

        // split string with white space
        String[] stringParts=S.split("\\s");

        Stack<Integer> stack=new Stack<>();

        for (int i=0;i<stringParts.length;i++) {
            Integer in;

This file has been truncated. show original

POP : Pop the elements from the stack.
DUP : Duplicates top element, makes a copy of it and places it at the top of the stack.
+ : Pops top two elements, adds them and places the sum to top of the stack.
- : Same like + except it subtracts top element with second top element.

Q3 -

Solution for Q3 -