Los ingenieros de software se encargan de diseñar y desarrollar software informático. Las entrevistas serán muy técnicas, así que debes prepararte para resolver problemas de código y desafíos matemáticos. Las preguntas concretas que te planteen dependerán del tipo de puesto de programación al que aspires. Intenta buscar una disciplina de software concreta, como desarrollo web, desarrollo de aplicaciones o desarrollo de sistemas.
Implement a function string balanceParanthesis(string s); which given a string s consisting of some parenthesis returns a string s1 in which parenthesis are balanced and differences between s and s1 are minimum. Eg - "(ab(xy)u)2)" -> "(ab(xy)u)2" ")))(((" -> ""
class A { public A() { foo(); } public void foo() { System.out.println("Class A"); } } class B extends A { public B(){} public void foo() { System.out.println("Class B"); } } class main { public static void main(String[] args) { A a = new B(); } } What does it print? Class A or Class B?
Given two strings representing integer numbers ("123" , "30") return a string representing the sum of the two numbers ("153")
You have datastructure my $users = [ { name => 'John', score => 10, }, { name => 'Bob', score => 1, }, { name => 'Carlos', score => 5 }, { name => 'Alice', score => 5, }, { name => 'Donald', score => 7 } ]; now u have to arrange the name with highest to lower score, if score is same than in alphabetical order #expected output: # John # Donald # Alice # Carlos # Bob
Find number of ones in an integer.
Write a function(int[]) -> int that returns the lowest unassigned integer. For example [] -> 1 (empty set), [1] -> 2, [5, 3, 1] -> 2. Basically just sort the array, iterate, and compare current and previous. If there is a gap then that's your number.
Verify that a binary search tree is indeed a binary search tree.
Write a program to print * * * * * * * * * * * * * * * * * * * * * * * * * * * * * with minimum number of variable use
If you have an unsorted array of numbers from 1-100, except 1 of those numbers is missing, how do you determine which number is missing
Viewing 81 - 90 interview questions