Return the head node of the singly linked list with each pair of nodes swapped. If there is a last odd node leave it in place. Example: Input: 1 -> 2 -> 3 -> 4 -> 5 Output: 2 -> 1 -> 4 -> 3 -> 5
Software Engineer At Interview Questions
665,112 software engineer at interview questions shared by candidates
You are given a list of strings (e.g. ["cat", "dog", "hat", "apple", "c"] ). Write a program that would take as input a string containing a wild card character, like "*at", "**t" (could be "cat", "hat", "bat"), "ca*", etc. and return true if there is a corresponding string in the list, and false otherwise.
You have 8 balls. All are identical except one is slightly heavier. You have a balance. What is the minimum number of weighings required to find the heavier ball?
How many unique paths are there from B-L point to the T-R point of a chess table? What would be your approach to calculate this?
Describe a function (in C) that does the following Input : an integer. Output: if that integer is 4, the function returns 7. if that integer is 7, the function returns 4. constraints: the input is SURE to be either 4 or 7. no need to validate. you are not allowed to use any condition/flow commands (if, switch, while, for, trinary operator...) you are not allowed to use any external library or import anything (like math..) you are not allowed to use %(modulu), * (multiplication)
reverse bits of an integer that is a power of 2 , keeping complexity in mind.
Given an integer array, write a program that returns an array with elements = product of the integers in input array except the one in its position. Ex: Given input: [2, 3, 10, 4, 5], output: [600, 400, 120, 300, 240] What is the complexity of your program? When will your program not work? Below is what I presented (O(n)), but it did not qualify me for the next round.
If a batsman given super powers so that he can hit any run[6,4 ,etc] and he wants to score highest run for himself , how he'll do that in 50 over game?
Given a collection of numbers, it has two functions: insert() and getMedian(). Choose a data structure to construct this collection and design the insert() and getMedian() function. Explain the time complexity of each function.
This round consists of 6 competitive coding questions and you need to solve at least 4 to get you through.
Viewing 591 - 600 interview questions
See Interview Questions for Similar Jobs
Operations Engineer.net DeveloperMobile DeveloperPrincipal EngineerFirmware EngineerGame ProgrammerMobile EngineerJr Security AnalystPython DeveloperSenior DeveloperTechnical Program ManagerApplication DeveloperQa EngineerDevops EngineerAtg DeveloperData EngineerLead EngineerSoftware DeveloperC Developer