There is a wall on your back side. Can you break it without any help or hammer?
Engineer Software Interview Questions
512,223 engineer software interview questions shared by candidates
how to print a singly linked list backwards
1) Palindrome in String and number 2) Substring palindrome Eg: abcDADxyz is a palindrome,abcDACxyz is not a palindrome 3) print True when String Contains integer otherwise print False 4) print the given number is a binary number or not and print true if it is binary 5) pattern program * ** *** **** ***** 6) delete the duplicate element in a={1,3,5,6,3} answer {1,3,5,6} 7)delete the duplicate char in the given string Eg: "this is String" Output will be: t r n g 8)Strong number 9)Amstrong number 10) fibonic series using recursion 11) print the given first and last string of substring input: I was string output for was: 3,5 12) print the given number without Arthimatic input: 12345 output: 1020304050 13) print the given number input: 12345 output:54321( without using default function) 14) input : decimal10.25 ; output: binary10,25
Usual interview questions and multiple unprofessional questions
Finding the length of the longest substring containing unique characters
Merge 2 sorted lists
Programs like remove the duplicate numbers in sorted array by scanning the array only once, means {1,1,2,3,6,8,8,8,8}-->{1,2,3,6,8}, producer and consumer problem, and finding the sum of diagonal elemts in array of any size, etc
Difference between Encapsulation and Abstraction. Examples of OOPS concepts. Java Interfaces, access modifiers. Classes Objects. Keys in DBMS Difference between DROP, DELETE and TRUNCATE One question from coding round(which I could not solve). I was given 15 minutes to solve but I was unable to solve. Interviewers were helpful and Company is good.
Tail recursive function for calculating factorial. (I did it in scheme)
1. Given an Array , E.g. [2,5,6,3,9,5,10,56,25] and a number X. now find all the contigous subarrays with length X , if X=3, then all the subarrays are [2,5,6], [5,6,3], [6,3,9] etc. now in all these subarrays find the minimum element. and out of all those minimum elements, return the maximum one. 2. Given a URL, Query the URL and fetch the JSON result (paginated), find all the subsequent result from new pages. parse the json and do some manipulation on that data, find a specific dataset from that json.
Viewing 1831 - 1840 interview questions