Programming on DSA SQL queries Logical Puzzles
Software Development Engineer I Interview Questions
1,214 software development engineer i interview questions shared by candidates
Based on heap, stacks, binary search, tree and graph
Round 1 (Machine Coding Round)(90 mins): Give a brief about your projects Problem statement: Digital wallet implementation There are several functionalities need to be implemented. All the test cases should pass. functionalities to implement: --> create wallet(accountholder, amount) //creates wallet and initialise balance --> transferMoney(acc1, acc2, amount) // transfer money from acc1 to acc2 --> statement(acc) // type of transfer(credit/debit), fromacc/toacc, amount --> offer1 --> acc_bal1 == acc_bal2 // after transaction if both acc bal are equal, then both are credited with 10/- --> offer2 --> 3 top customers --> 10 , 5, 2 (no of trans, acc_bal, creation_time) // top3 customers based on priority mentioned gets 10/-,5/-,2/- --> Overview(acc[]) // accholer, balance of all the customers After executing, interviewer asks for code walkthrough. PFA my answer for above problem.
Problem 3 - Given a string, find the maximum length substring having at max k unique characters. eg - abcaacabcabcaa k=2 ans =5 (caaca) given two pointer approach and hashmap sliding window
Problem 2 - Given a tree, each node of the tree has some coins you need to collect the maximum number of coins such that you do not collect coins from any alternate nodes. i.e if you collect coins from a node, you can not collect from any of it's adjacent node. eg - 1 / \ 5 6 / \ / \ 2 1 9 4 / \ 3 1 (5 + 3 + 9 + 4) = 21 given dfs approach dp on trees
Tell me about yourself
If there's any reason make you not to choose a company, what it's going to be? / or What is your ideal dream job's attribute?
1 ques on serialization and deserialization of n-ary tree
Cannot disclose the question but they were LC Easy/Medium. Also be prepared to answer in detail a system design question in one of the rounds.
Considering that it's a Dev I position, I didn't get any big surprises during the interview. However I've heard that for higher positions it can be pretty tough on the technical side.
Viewing 661 - 670 interview questions