Why sitel?
Engineer 1 Interview Questions
3,922 engineer 1 interview questions shared by candidates
Design tinyurl No of possible paths in a graph from start to end bit operations question - was based on xor operation Question about databases - had to use triggers to provide solution How can you improve quality of life in india using tech.
mirror tree, ladder dp question, sum of two numbers in array, AVL tree implementation
Standard Word break DP, problem
Preguntas sobre derivados (forward, futures, swaps y opciones y sus respectivos métodos de valoración), VaR, POD, LGD, Expected Exposure ... Preguntas sobre riesgos. Tipos de riesgos y formas de reducirlo
It was coding questions from leetcode.
Mostly situational question. Things that I have experienced while on site.
Got rejected in first round itself. Round 1:- Problem solving round You should be strong in DSA. Q1. Find the center element in linked list Q2. Explain HashMap Programs:- All these program questions they asked are from GeeksforGeeks P1:- A number will be given example 74. you have to find the prime numbers which produces that number when you add them. 3+71 = 74. P2:-Given an array and a value, find if there is a triplet in array whose sum is equal to the given value. If there is such a triplet present in array, then print the triplet and return true. Else return false. Input: array = {12, 3, 4, 1, 6, 9}, sum = 24; Output: 12, 3, 9 Explanation: There is a triplet (12, 3 and 9) present in the array whose sum is 24. Input: array = {1, 2, 3, 4, 5}, sum = 9 Output: 5, 3, 1 Explanation: There is a triplet (5, 3 and 1) present in the array whose sum is 9. P3:Given an array of distinct integers and a sum value. Find count of triplets with sum smaller than given sum value. The expected Time Complexity is O(n2). Input : arr[] = {-2, 0, 1, 3} sum = 2. Output : 2 Explanation : Below are triplets with sum less than 2 (-2, 0, 1) and (-2, 0, 3) Input : arr[] = {5, 1, 3, 4, 7} sum = 12. Output : 4 Explanation : Below are triplets with sum less than 12 (1, 3, 4), (1, 3, 5), (1, 3, 7) and (1, 4, 5)
Level Order Binary Tree Traversal
1. Find LCA 2. Given preorder and inorder find tree structure.
Viewing 3241 - 3250 interview questions