Two strings were given with numerical characters. I was asked for the count of duplicates and the duplicate characters which are present in both the strings. For eg : 1522 and 5314 has two duplicate characters 5 and 1.
Software Engineer Interview Questions
467,266 software engineer interview questions shared by candidates
In a competitive exam joy got 340. if he got 5 marks for each correct ans & -3 for each incorrect one. plz tell how many question he has attended?(it is not the actual question but a type of)
Write a Program in C or Java to check if a number is a Colindrome or not. Colidrome is a word that has 3 alphabets followed by the reverse of the 3 alphabets and so on: Ex: cappac mollomaappaa
Write a program to find the number of occurrence of a string in another string in any language
- Describe in detail your most involved and difficult project you've done in the past. - Difference between objects and classes in C++. - You're given two arrays of strings. Determine if all the strings in the first array are present in the second array, and return a boolean. Now assume both arrays have a million elements each. How would your answer change to improve efficiency?
Write a method that would reverse the merge sort, ie given many Objects with mapped sorted values to it, create a one big HashMap that is sorted by each Object and is sorted inside each Object by the timestamp.
You are given an alphanumeric string. Complete the function sortSegments that will segment the string into substrings of consecutive letters or numbers and then sort the substrings. For example, the string "AZQF013452BAB" will result in "AFQZ012345ABB". The input letters will be uppercase and numbers will be between 0 and 9 inclusive.
Implement x^y function in an imaginary proccessor who doesnt have +, /, * operators.
Expectation for coding Questions: Must be sort of analytical questions testing knowledge of DS/Algos and problem-solving skills, that could be done in 65-70 minutes. Reality: Problem Solving tricky questions, I would say they are not really checking candidate's Data Structures knowledge. Standard DS/Algos can be used to come up with the sol, but again coming up with the optimised sol. is the challenging part, I feel. I though it could only be done in the given time frame with most optimised approach, only if candidate had gone through that kind of question in the past. Brute Force or Semi-optimised approach can be thought of, but coming up with most optimised approach in the given time frame, needs some serious practice and some luck too😅. According to me, either questions' difficulty level should be reduced or time can be increased.
There are 25 horses. You get to race them 5 at a time, determining relative ranking. How many races does it take to figure out the top 3?
Viewing 1781 - 1790 interview questions
See Interview Questions for Similar Jobs
.net DeveloperOperations EngineerMobile EngineerMobile DeveloperGame ProgrammerPrincipal EngineerFirmware EngineerSoftware DeveloperPython DeveloperSenior DeveloperData EngineerLead EngineerC DeveloperJr Security AnalystAtg DeveloperTechnical Program ManagerApplication DeveloperDevops EngineerQa Engineer