Software Engineer 2 Interview Questions

Software Engineer

Interviewed at Meta

3.5★

Sep 26, 2011

Write the actual code to parse a regular expression including "*", which stands for 0 or more characters, "+", which stands for 1 or more characters, and ".", which stands for 1 exact character.

IOS Developer

Interviewed at Meta

3.5★

Jan 5, 2018

What languages do you program in

Software Engineer

Interviewed at ServiceNow

4.1★

Apr 30, 2020

Given an array [1, 2, 3, 4, 3, 5] and number x, rotate the array such that all occurrences of x are shifted at the end. For example, x = 3, then output should be [1, 2, 4, 5, 3, 3]

Algorithm Developer

Interviewed at Hudson River Trading

4.2★

Sep 27, 2024

You have three sock drawers. One has red and blue socks, one has blue and green socks, and one has green and red socks. What is the expected number of socks you must pull to be sure which drawer is which, assuming that the number of socks of each color in each drawer is both large and equal?

Software Developer

Interviewed at Paycom

3.3★

Oct 16, 2020

Reversal of String Difference between GET and POST REST API

Software Engineer

Interviewed at Salesforce

4★

Sep 8, 2015

Implement a stack using a Queue

Software Engineer

Interviewed at Amazon

3.5★

Jan 23, 2010

I had a difficult question about a cuboid composed of smaller cubes. How many cubes are there where exactly two faces of the cube are exposed?

Software Engineer Internship

Interviewed at Amazon

3.5★

Apr 16, 2011

How would you count the number of words in a string consisting of uneven number of spaces between words( not dictionary words)? With and without library functions.

Software Engineer

Interviewed at Amazon

3.5★

Apr 4, 2011

There are 199 elements in array. It has only one distinct value? How will find this distinct value? Also for solution please tell about O(n)?How can you make it more efficient?

Software Engineer

Interviewed at Amazon

3.5★

Apr 27, 2011

Given a binary tree with only upwards (parent) node references, re-construct the tree adding in child references. You are given a list of leaf nodes (sorted in left to right order). Tricks include making sure to account for extremely unbalanced trees.