Full Stack Interview Questions
12K
Full Stack interview questions shared by candidates
How would you build a BART train system.
2 Answers↳
Various infrastructure, logic, and fail safe issues. Caching, redundancy, customer experience handling in case of failures. Less
↳
I would identify and address all of the various infrastructure, logic, and fail safe issues as well as design systems to handle caching, redundancy, and customer experience handling in case of failures. Less
Design the DB and server system where multiple users can enter calendar events, including alerts for those events.
1 Answers↳
I designed the tables and columns I would need in a SQL database, and I wrote some pseudocode that would run in a cron job to send out alerts. I also wrote the SQL query to get all alerts that are pending. Once prompted, I added indexes and optimized the query. Less
Given a formula (string) and a dict, replace each key that appears in the formula with its value. "CONCATENATE("#first_name#", " - ", 30)" { 'first_name': "Moshe", 'age': 20, 'status': "Done"} Result: "CONCATENATE("Moshe", " - ", 30)"
9 Answers↳
column_id_to_value = {'first_name': "Moshe", 'age': 20, 'status': "Done"} formula = 'CONCATENATE("#first_name#", " - ", #age#)' dotIt(formula, column_id_to_value) def dotIt(formula, dictionary): answer = [] formula_list = formula.split("#") for form in formula_list: if form in dictionary: answer.append(str(dictionary[form])) else: answer.append(form) print(''.join(answer)) Less
↳
let formula = "CONCATENATE('#first_name#', ' - ', '#age#')"; let user = { first_name: "Moshe", age: 20, status: "Done"}; let keys = Object.keys(user); function getKeys() { const keys = Object.keys(user); keys.forEach( key => formula = formula.replace(new RegExp('#'+key+'#'), user[key])); console.log(formula); } getKeys(); Less
↳
def calculate_for_row(formula, column_id_to_value): result = [] replaced_last_part = False new_formula_parts = formula.split('#') for index, part in enumerate(new_formula_parts): if part in column_id_to_value: result.append(str(column_id_to_value[part])) replaced_last_part = True else: if index > 0 and not replaced_last_part: result.append('#') result.append(part) replaced_last_part = False parse(''.join(result)) def parse(formula): print(formula) column_id_to_value = {'first_name': "Moshe", 'age': 20, 'status': "Done"} formula = 'CONCATENATE("#first_name#", " - ", #age#)' calculate_for_row(formula, column_id_to_value) Less
list and array related questions Basic sql question
7 Answers↳
did my level best in 2nd round but not selected.
↳
Can you share 2nd round question
↳
Hi, can you please share the coding questions asked in round 2?
Print patterns like Swastic sign, 2-D Array manipulations(Bit Difficult) and String manipulations.
6 Answers↳
They will mail the exact date. The joining date is between 6-16 aug. The difficulty of 2nd round was medium. One question was a bit difficult and the rest were medium.If you are good at coding and regularly doing it then you can easily crack it. Less
↳
Be sure you are good at coding.
↳
when is your joining??what is the difficulty of 2nd round?
return true if array of size n contains a permutation of [1,n]
5 Answers↳
for(var i=0; i
↳
public static bool isPermutation(int[] arr) { int num = 0; for (int i = 0; i arr.Length) return false;//number out of range int tmp = 1 << (arr[i]-1); if ((num & tmp) == tmp) return false;// number was found before - duplicate num |= tmp; } return true; } Less
↳
// Java Program to decide if an // array represents a permutation or not import java.util.*; class GFG{ // Function to check if an // array represents a permutation or not static boolean permutation(int []arr, int n) { // Set to check the count // of non-repeating elements Set hash = new HashSet(); int maxEle = 0; for (int i = 0; i < n; i++) { // Insert all elements in the set hash.add(arr[i]); // Calculating the max element maxEle = Math.max(maxEle, arr[i]); } if (maxEle != n) return false; // Check if set size is equal to n if (hash.size() == n) return true; return false; } // Driver code public static void main(String args[]) { int arr[] = { 1, 2, 5, 3, 2 }; int n = arr.length; if (permutation(arr, n)) System.out.println("Yes"); else System.out.println("No"); } } Less
Why did i choose to apply for JATO?
5 Answers↳
I answered with I am looking for a challenge and to join a company that has a long term vision and goal and they needs people like me to join the journey and support them through the company transformation. Less
↳
Read my "Database Production Assistant" and you will realise how slippery, contorted, unreliable and mendacious they are, worthy of avoiding for aye. Less
↳
Thank you for your review. JATO appreciate the comments and feedback provided and are happy to hear you were happy with the outcome of the interview, even though the technical questions were a little difficult. Less
What are the design patterns? What is a promise? Asked about my projects Program about linked list
5 Answers↳
Builder pattern A linked list is a linear data with structure in which elements , design a data structure that supports for following operations Less
↳
Oct 2nd
↳
Yes we have to conduct the interview
solve a problem without for loops
5 Answers
difference between null and void
5 Answers↳
Could you please tell us what can be the expected salary for 4-5 years of experience candidate. Less
↳
Do you know what is the salary band for PM?
↳
How much salary did they offer you?