Softwareentwickler sind besonders gefragt und diese Rolle kann auch sehr gute Verdienstmöglichkeiten und hohe Arbeitszufriedenheit bieten. Bei einem Vorstellungsgespräch für Softwareentwickler werden Ihnen wahrscheinlich Fragen zu Ihren Hard und Soft Skills sowie zum effizienten Projektmanagement gestellt.
Java program in round 3 was the most difficult question in my case. A matrix halfly-filled with numbers - almost randomly was given . And You need to fill the blank matrix of same size with those numbers in similar arrangement in a program using 2D arrays and loops.
However the interview was about Senior Java Position, I just asked a couple of questions about Java and nothing about Javascript. The interview questions were about: 1. Data structure and algorithms (30 minutes) 2. Operating Systems Concepts (System calls, concurrency, etc, Device Drivers.) 3. TCP/IP Layered protocol ( I was really really good at this when I was in college :) ) Till now about 1 hour or more passed from the 90 minutes interview... 4. Couple of questions about REST, Java Concurrency and Testing I could understand the emphasis on the OS, algorithms design and analysis is to be asked at Google & Amazon-like companies or to be asked to a fresh engineer he is just graduated from the university with a fresh knowledge. I am not denying their questions about OS, Data structure, and algorithms, but to make most on the interview for such topics and eventually got rejected because my knowledge in JavaScript is not enough is not honesty in reporting the Interview status. I answered the algorithms question and OS, TCP/IP from memory (which mostly wasn't that accurate as I left university more than 10 years back).
Find the maximum product of 3 numbers in a list.
You have two intersecting linked lists. Describe a function that returns a pointer to the node where they intersect.
Merge 2 sorted arrays A and B Result should end up in B, which has available space for all items Utilize the space in B, not using temporary arrays Result in sorted array in B A { 2, 5, 8, 12, 15} B { 3, 5, 7, 9, , , , , , }
sort an array N consists of four numbers, each number can be repeated k times, where k < n. Example: sort 1111144422223 to 1111122223444. Try to be as efficient as you can, not just O(n^2)
How would you sort an array if you had infinite RAM? Infinite memory?
Getting the min from a stack in O(1) time
2 Coding questions, providing complete solution is the main thing they want and not the optimization.
Given a database, where we know some portion of data (e.g. say 20%) is accessed more than the other portion of the database by the client. We have a frontend that client requests data from. Design a data structure that will increase the efficiency of access of objects. And we know that we can only hold on to n elements in memory.
Viewing 1781 - 1790 interview questions