hardest problem ever done and implement it using classes
Applications Software Engineer Interview Questions
6,683 applications software engineer interview questions shared by candidates
1. sort the array such that even numbers in ascending order and odd numbers in descending order 2. n number of cards will be given out of 52 playing cards sort them according to colour and value 3. 4X4 matrix given which contains characters. one word will be given check all character of given word are present in array or not 4. a long string of numbers will be given like 99100102103104016 find the missing number here 105 it can be of 1/2/3 or any length numbers ex 1234568 or 1112131416 or 9101113 or anything others are also there 5. 8X8 chess board containing only soldiers at different places soldier can move up, down, left, right. two soldiers are said to be connected if they are in soldier movement places. find the max connected component. 6. shuffled cards are given sort them
Basic oop concepts, linked lists, asked to implement queue,algorithm of tower of Hanoi and some puzzles.
1.Difference between C++ and C 2.Questions from tree and asked me to write a code 3.Asked me to write a function in PLSQL. 4.Questions asked from DBMS (normalisation,types,view) 5.He gave me a table and asked me to normalise it. 6.Asked me to write a Sql code(Questions was from JOIN)
string concatenation
given a date and number of days, how will you calculate the date after the given number of days, without using inbuilt date functions
Write a recursive program to calculate factorial and asked about how the calling of function takes place and how the stack is used for that
How many squares are there in a chess board?
• Exception handling • Difference between finally and finalize. To close a JDBC connection object, which is the better choice? • Hashing, Hash Map in Java • Write a program to store the count of each integer in an array of integers. • Find the kth largest element in an array without sorting the array. • Find the second maximum element in an array in O(n) time complexity. • Sort a linked list using any sorting algorithm (Merge Sort). • Given a sorted array such that it is rotated n times, find the smallest element in the array in O(log n) time complexity.
All core java questions that includes general OOP principles, Generics, Collection, Strings, Arrays.
Viewing 6481 - 6490 interview questions