Software Developer

Software Developer Interview Questions

Most Searched Companies

4089 results found

Sort By: 

Popularity

Interview Questions

  • Q1. website having several web-pages. And also there are lot many user who are accessing the web-site. say user 1 has access pattern : x->y->z->a->b->c->d->e->f user 2 has access pattern : z->a->b->c->d user 3 has access pattern : y->z->a->b->c->d user 4 has access pattern : a->b->c->d and list goes on for lot many users which are finite and numbered. Now the question is we have to determine the top 3 most occurring k-Page-sequence. for the above example result will be : (k=3) a->b->c , b->c->d , z->a->b

    View answer (3)
  • Q2. There is a 12 km road and a contractor who is in-charge of repairing it. Contractor updates you about the work which is done in patches. Like “Road between 3.2 km to 7.9 km repaired ”, “Road between 1.21 km to 3.2 km repaired”. You have a manager who enquires about the longest continuous patch so far. It was a long discussion and I gave solution in O(nlogn) where n is the number of updates by the contractor

    Add Answer
  • Q3. 14. you have given a string of multiline. you have to print the maximum occupancy word in each line and if there is some capital letter in each line then print each capital letter occupancy and then small letter occupancy. ex given string is Abccddegdkshsl aghdoiuuaknclna AHBalowknxxbb ajhduiaklaLLL your o/p should be : A -1, d-3 a-3 A-1,H-1,B-1,x-2,b-2 L-3,a-3

    Add Answer
  • Q4. Check for balancing of parenthesis using divide and conquer. Didn’t ask for code just wanted the approach. I solved it with stack. But he just wanted Divide and conquer. After thinking for 15 minutes and observing several examples. I came up with an algo and bingo(According to me whole 5 rounds were quite easy and that question made the difference for me). :)

    Add Answer
  • Q5. Given two array , one of size m+n and contains m element and other position are empty , 2nd array is of size n and contains n element. both array are sorted , now merge the second array to first one such that the resultant array is sorted. Expexte time complexity(m+n)

    Add Answer

+172 interview questions

Interview Questions

  • Q1. A file or a directory can be represented as a node. The node has properties like ID no, parent ID no, name, no of children( 0 for a file). The entire file structure is represented as a linked list of the nodes. Only thing known to us is that the parent directory will always come before the children in the LL. It need not come immediately before.We have to implement a GUI such that when I press on the + button next to the root directory, I see its children folders and files. The child directories have a + button next to them and can be expanded similarly.Write a pseudocode to implement this in minimum time and space.I suggested the use of a tree, wrote a code to convert it to a tree

    Add Answer
  • Q2. A file or a directory can be represented as a node. The node has properties like ID no, parent ID no, name, no of children( 0 for a file). The entire file structure is represented as a linked list of the nodes. Only thing known to us is that the parent directory will always come before the children in the LL. It need not come immediately before.We have to implement a GUI such that when I press on the + button next to the root directory, I see its children folders and files. The child directories have a + button next to them and can be expanded similarly.Write a pseudocode to implement this in minimum time and space.I suggested the use of a tree, wrote a code to convert it to a tree

    Add Answer
  • Q3. You are given infinite sequence of continuos natural numbers-1,2,3,4,5,6.......... Initially you delete every 2nd element so sequence will be 1,3,,5,7,9,11,13..... now in the resultant sequence you delete every third element i.e now 5,11...will be deleted. The numbers which will remain in sequence after infinite number of iterations are called lucky numbers(for e.g 1 is lucky number because it will be never deleted). WAP to check whether given number n is lucky or not

    View answer (1)
  • Q4. Time complexity of a function f(m) is O(m). If the array[i...n] > contains either 1 or 0 in each of it's locations, determine the worst > case time complexity of the following piece of code written in C-like > language. > > counter=0; > for(i=0; i=n; i++){ > if(a[i]==1) > counter++; > else{ > f(counter); > counter=0; > > } > } > > * i=n was given in the condition of for loop > > a) O(n^2) > b) O(n^2 logn) > c) O(nlogn) > d) O(n)

    Add Answer
  • Q5. Given a string s[1...n] and a reverse function reverse(s, i, k) > which reverses the character sequence from i to k (inclusive of both) > in string s, determine what the following operations result in. > 1<k<n > > reverse(s, 1, k) > reverse(s, k+1, n) > reverse(s, 1, n) > > a) Reverses the string > b) Rotates the String left k positions > c) Rotates the String right k positions > d) None of the above

    Add Answer

+74 interview questions

Interview Questions

  • Q1. Since my resume was almost completely filled with technologies related to web developement, i was asked many questions from the same. Some of the questions i was asked are: 1) what do you mean by full stack? 2) what is an API? 3) what is frontend/backend? 4) what do you mean by a GET and a POST request? 5) what is a database? 6) state the difference between SQL an NoSQL database 7) what is OOP? 8) what do mean by 'Object' in OOP? . At last, i was told to write some HTML, JavaScript and ReactJS on notepad.

    View answer (9)
  • Q2. They asked me to choose one language (Java or C) that I have written in my resume .I have chosen java .The questions they asked goes like this. 1.why Java is platform independent? 2.Is there call by value or call by reference concept in java.3.what is abstract class .4.what is an interface.5.What is hash map ? 6.what are the technologies you know .7.explain block chain .8 .what are oops concepts .9.I was asked to write the code for fibonocci series.

    Add Answer
  • Q3. basic introduction and questions from our projects mentioned in resume and questions in programming languages mentioned in the resume starting from basic questions to difficult ones

    Add Answer
  • Q4. For 1-2 years experience, they will only ask for Java basics but if you prove to be good, they will even ask Spring/boot. so mostly clear your logic and have reason for your answer

    Add Answer
  • Q5. difference between c and c++,oops concept,about java,run some program from java and asked about its syntax,and about the project,some behaviourable ques.

    Add Answer

+171 interview questions

Interview Questions

  • Q1. Then he wrote out some code and asked me how the compiler will generate code for it. I gave some answer, but he was clearly not satisfied. I thought it was all over by then. Then, he asked me a DIP question. He commented that he had given that particular question to his juniors once and they had done a very good job at it. The problem is this: A teacher is writing on a blackboard and we want to pass all the information on the blackboard over a low-bandwidth network in real-time. How do we do it

    View answer (1)
  • Q2. There is a clock at the bottom of the hill and a clock at the top of the hill. The clock at the bottom of the hill works fine but the clock at the top doesn’t. How will you synchronize the two clocks. Obviously, you can’t carry either of the clocks up or down the hill! And you have a horse to help you transport yourself. And, the time required for going up the hill is not equal to the time required to go down the hill

    Add Answer
  • Q3. He then asked me a question that had been asked in Round 4, written test:Describe an optimal algorithm to find the second minimum number in an array of numbers. What is the exact number of comparisons required in the worst case? Note that they didn’t ask the order in Big-Oh notation. They wanted the exact number of comparisons.

    Add Answer
  • Q4. He asked me some questions on Interprocess Communication: What’s a semaphore? How are they used? He would often pick out words from my answers and ask me what they meant. He wanted to make sure that I really knew what I was talking about

    Add Answer
  • Q5. You have a lot of small integers in an array. You have to multiply all of them. You need not worry about overflow and range, you have enough support for that. What can you do to speed up the multiplication on your machine?

    Add Answer

+53 interview questions

Interview Questions

  • Q1. 1. Core Java - OOPS features, Abstract classes and Interface, Inner Classes, String and Object Class, Equals and HashCode methods, Runtime and Compile time exception, Method overloading and overriding, Custom Exception, Array List vs LinkedList, HashMap internal working, Various ways to create threads, Synchronization

    View answer (1)
  • Q2. Data structure and algorithm and I was tested more on approaching complex programs with a fastest and reliable logic but they didn't expect the exact output or syntax they just need my analytical and logic approaching ability

    Add Answer
  • Q3. Oops concepts, String manipulation programs, arrays, linkedlist related programs, REST APIs, POST GET, sql query to find total number of distinct employees having salary more than x, few linux commands

    Add Answer
  • Q4. In written round, few multiple types questions are there mainly aptitude and short programming questions. There were 2 coding questions and i solved one question (left rotate the integer n times).

    Add Answer
  • Q5. Basics of Jcl like class parameters, Questions from Sorting and disp parameters as well aa Gdg. In cobol variouws error codes and also db2 and Ims db questions.

    Add Answer

+93 interview questions

Interview Questions

  • Q1. They asked me on java and I have joined as a fresher they not much questions as I got selected as fresher on oops concepts and collections

    Add Answer
  • Q2. 1. what is the difference between exception and error. How did u solve the errors in the code deployment?

    View answer (1)
  • Q3. Many challenges I would like to excited professionally that is always I want to choose difficult path.

    Add Answer
  • Q4. They asked questions related to spring boot ,microservice and related to docker ,kubernete and kafaka

    Add Answer
  • Q5. I were asked to print the number of pairs in an array whose sum is equal to given number k

    Add Answer

+151 interview questions

Interview Questions

  • Q1. Given n sequences, and starting and stopping point of every sequence with its score. For eg. no of sequences = 5 start stop score 0 4 4 3 10 11 6 8 8 7 15 10 11 15 4 All scores are positive. You have to find the maximum subset of non overlapping sequences having maximum total sum of scores. I proposed a n^2 approach first and then modified it to nlgn

    Add Answer
  • Q2. Input : 4 jars and 50 balls of different colors (Red, Green, Yellow, Blue) where each jar can contain a maximum of 100 balls.Problem : When a user draws a red ball he loses his money while if he draws a ball of some other color his money is doubled. Arrange the balls in such a way that the user has highest probability to lose

    Add Answer
  • Q3. There is code like var i; { .. var j; .. } var k; .. var a; { .. var c; { var i; } .. var d; .. } For simplicity you may assume that there is only one variable declaration on 1 line. Now given a line number, you have to tell what all variables are valid on that line. Propose an algorithm for this

    Add Answer
  • Q4. Modify this code to find the maximum subtree in tree which is a BST. Maximum subtree means subtree goes upto its leaves from any node. Modify the code again to find the maximum tree which is a BST. BST can lie anywhere and it may or may not go upto its leaves

    Add Answer
  • Q5. A sentence is given which contains lowercase English letters and spaces. It may contain multiple spaces. Get first letter of every word and return the result as a string. The result should not contain any space

    Add Answer

+31 interview questions

Interview Questions

  • Q1. Image data structure: An image(square image) can be stored as a tree: A node is white if the image is white, is black if the image is black, and is mixed if it contains both. White and black nodes are leaves, whereas a mixed node will have exactly 4 children, representing the 4 quadrants in the image. Given 2 images (trees), find the image representing their intersection. (Intersection: B^B -> B, B^W -> W, W^W->W)

    Add Answer
  • Q2. There are three rooms, and there are Princess, Flowers and Snake in those rooms. The doors of all the rooms have incorrect nameplates. i.e., the nameplate for the princess’ room is not Princess. Similarly, the nameplate for the Flowers’ room is not Flowers. You need to find the room of the Princess without going to the room of Snake. How do you find?

    View answer (1)
  • Q3. Say you have three tables WORK, USERS, MANAGERS WORK - work_id - user_id - how_much USERS - user_id - team MANAGERS - manager_id - team If I am a manager, write a select statement to retrieve the work of all users who belong to my team. The mapping of user to team and team to manager are defined in the USERS and MANAGERS table

    Add Answer
  • Q4. There is a dictionary containing words in sorted order. These words consist of some alien alphabets. Using the dictionary, find out the ordering between the alphabets. For eg, if English was the alien language, with a,b,c, etc. as the characters, and given an english dictionary, the algorithm should output a < b < c < .... < z

    Add Answer
  • Q5. Given n pens and n tops, each pen (and each top) having a size different than the other and each pen fitting exactly one top, find the largest pen using minimum number of comparisons. A comparison involves picking a pen and a top and trying to fit them, and would result in a. proper fit b. pen is larger c. top is larger

    Add Answer

+15 interview questions

Interview Questions

  • Q1. Design a parking lot? Design should include -Logic Flow Diagram -E-R diagram (very important) -DB tables with relations between them, preferably normalized -Commands for transaction with tables

    Add Answer
  • Q2. Given a tree, WAP such that a matrix is generated so that: Tree: 1 / 2 3 | / 4 5 6 Matrix: 0 1 2 3 4 5 6 1 0 1 1 1 1 1 2 0 0 0 1 0 0 3 0 0 0 0 1 1 4 0 0 0 0 0 0 5 0 0 0 0 0 0 6 0 0 0 0 0 0

    Add Answer
  • Q3. Given some situation amd how do you face it Given some problem.and how will you solve it Some puzzles Hobbies Relocatiob

    Add Answer
  • Q4. Given an array, sort the zeroes from non zeros for example Input: 1 2 0 0 7 4 42 0 0 0 6 Output: 1 2 7 4 42 6 0 0 0 0 0

    View answer (1)
  • Q5. Apart from technical questions a few HR questions were asked. For example: Why do you want to join this company?

    Add Answer

+62 interview questions

Interview Questions

  • Q1. Given an array of elements. We can perform following operation only- Increase an array element. Cost of operation is the amount of increment made per array element. Now for a given H, we need to make any H ( not necessarily consecutive ) elements of array equal with minimum cost. E.g. N=6, H=4 2 3 5 6 4 4 changes to -> 4 4 5 6 4 4 Cost is ( 4-2 + 4-3 = 3 ) N=6, H=3 2 3 5 6 4 4 changes to -> 2 4 5 6 4 4 Cost is ( 4-3 = 1 ) Optimal complexity- O(N)

    Add Answer
  • Q2. You have a deck of 10 cards.You take one card out and put it on table and put next card in the end of deck.You repeat this sequence till all cards are on the table.Sequence formed on the table is 1,2,3,4,5…10. What was the original sequence of card. After doing some exercise i answered 1,6,2,10,3,7,4,9,5,8

    Add Answer
  • Q3. There is a file which contains ip addresses and corresponding url. Example 192.168.1.15 www.abc.com 10.255.255.40 ----- You have to return the subnet mask of the ip and the url after “www.” Output 192.168.1 abc.com 10.19.76 snapdeal.com Write a Java function for that

    Add Answer
  • Q4. There are two sorted arrays. First one is of size m+n containing only ‘first’ m elements. Another one is of size n and contains n elements. Merge these two arrays into the first array of size m+n such that the output is sorted

    Add Answer
  • Q5. Tell me about yourself.Then by looking at my resume he said you don’t have hands on experience in Java as i was working in php.I said though i don’t have hands on experience but i am good in programming and oops concepts

    Add Answer

+26 interview questions