Array manipulations, BFS, DFS, etc.
Software Development Engineer I Interview Questions
1,214 software development engineer i interview questions shared by candidates
Rain Water Trapping problem Stock buying selling problem A graph Depth First Search problem
1. Return duplicated from an unsorted array 2. A grid problem with an input 'n' where n is an integer find the x, y coordinates, return x, y if n is a perfect square else return the close x,y coordinates of n, where -1<n<1. if n = 17, possibilities are (2,8), (3,6), (2,9) but you have to find the optimal value closest to the origin and return it.
Didn't advance to the face to face round unfortunately. But I can clearly tell you that you must learn data structures and algorithms. You must know how to represent them in a high level language like java etc.
How would you go about designing an university? What classes and methods will it have?
Determine the anagrams of a word in a file
Coding Round: 1. Given an array of integers, find the no. of distinct elements present in the array. 2. Write a SQL query to get no. of employees in each dept. of a company. (Assume the standard models for Employee and Department tables). 3. Read a log file, and print the no. of requests from each of the hosts. Each record in the log file will be in following format : <host-name> - - [time] [response-code] [time-taken(in ms)] For example, cart@example.com - - [2018-06-26 12:00:00] 200 12
You have a string "CAT" fin its anagram from the given set of strings ACT, TAC, DOG, TCA, BOB, JUM Ans: ACT, TAC, TCA
Extract a list of numbers from a list of strings such as ["A2D", "1B", "3F5", "67FE2", "AA"] such that the final result would be [2, 1, 3, 5, 67, 2].
Some other standard questions: 1. Given a BST and a range, print all the numbers that comes in that range. Ex: the function will be something like: print(node * head, int x, int y); It has to print all numbers within the rage x&y 2. Print max height (level) of a binary search tree. 3. Given an array of integers, determine the sub array which makes max sum. 4. Find LCA of the binary search tree.
Viewing 241 - 250 interview questions