GFG App
Open App
Browser
Continue

Tolexo Interview Experience for SDE-1

I was having an on-campus round of Tolexo.com

Round 1: Written pen-paper TestÂ

Q1) WriteÂ  aÂ  program to printÂ  theÂ Â  matrix ofÂ  n *Â  nÂ Â  into a spiral form

```1Â Â  2Â Â  3Â Â  4Â Â Â  5

14Â  15Â  16Â  17Â Â  6

13Â  20Â  19Â  18Â Â  7

12Â  11Â  10Â  9Â Â Â  8

OutputÂ  :Â Â  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
```

somewhat similar to this but not exactly

https://www.geeksforgeeks.org/print-a-given-matrix-in-spiral-form/

Q2)Â Â Â  WriteÂ  aÂ  program to find the number of trailing zeroes inÂ  n factorial

Example:Â Â  5

OutputÂ  :Â Â  1Â Â  ( 5! = 120)

https://www.geeksforgeeks.org/count-trailing-zeroes-factorial-number/.

Q3)Â Â  Write aÂ  program to print the longest palindromic substring in aÂ  string.

Example:Â Â Â  aabaac

Output:Â Â  aabaa

https://www.geeksforgeeks.org/longest-palindrome-substring-set-1/

https://www.geeksforgeeks.org/longest-palindromic-substring-set-2/

Q4)Â  Write aÂ  program to print first kÂ  and last kÂ  elements of the link list in reverse order.

WhereÂ  k = (n/3);Â  nÂ  is the size of the list

ExampleÂ  :

Input :Â Â Â Â Â Â Â Â  1 -> 2 – >Â  3 – > 4Â  -> 5 ->Â  6Â Â Â  ;Â  (k = 2 (6/3))

Output :Â Â Â Â Â  2 ->Â  1Â  ->Â  3 -> 4 -> 6 -> 5Â  ;

Q5)Â Â Â  Write aÂ  program to print the pairs in an array which has sum X.

For exampleÂ  :Â Â  sum = 15

InputÂ  :Â Â  6Â  7Â  8Â  9Â  1Â  14Â  5

Pairs which has sum = 15

( 6, 9 Â )Â  ,Â  (7,8)Â  , (1,14)

https://www.geeksforgeeks.org/count-pairs-with-given-sum/

Solved all the problems and was pretty sure to get through it.

Round 2:Â  I think it was my toughest round

SQL queries:Â  To find the second-largest salary in the employee table.Was asked to variousÂ  SQL commands like ALTER TABLE COMMAND,Â  ADD, Â To display the name, date from id = 1 to 10Â  without using where commands.

Many syntaxes I wasnâ€™t able to tell them.Â  But my approach was always right.

They looked intoÂ  CV now asked again something aboutÂ  PL-SQL queries and their applications what was the difference and advantages of using the user-defined library and so on.

I have told them the advantages of a user-defined library and how we can improve the complexity of the code.Â  How to prime number code can be improved using Sieve of Erasthonesis ( Sieve of Atkin) rather than using the inbuilt library and so on.

What is the difference between interfaces and abstract classes?

Q) To find the next big number of nÂ  which comprises of digits of n only.

For example â€ś 123â€ťÂ  Output: â€ś132â€ť.

Remarks: â€ś After some bit of discussion easily told them â€śÂ  – it was from geeks for geeks and solved it long back.

https://www.geeksforgeeks.org/find-next-greater-number-set-digits/

Q2)Â Â  Asked about the quiz:Â  There are three boxes having labels R& B, B, R and it is confirmed that all are incorrectly labeled.Â Â  Find that minimum trials in which the correct label could be detected.

Round 3 :

TheyÂ  lookÂ  intoÂ  myÂ  resumeÂ  and asked aboutÂ  myÂ  major projects: –Â  I told them about the use ofÂ  SVM (Support Vector Machines )Â  techniquesÂ  inÂ  sentimental analysis

Q) They asked me to code matrix multiplications. Of m *n and n*p.

Coded it Then they ask me an approach to optimize.Â  Then I tell me aboutÂ  Strassenâ€™s algorithm and itâ€™s the approach.

https://www.geeksforgeeks.org/strassens-matrix-multiplication/

Q) Then they look into my paper ( in which I had previously solved the questions)Â  and asked me to optimize the longest palindromic substring which I did use the brute force approach.

:Â  It took me a little while to understand the question sÂ  and then told me about Manchesterâ€™s algorithms used to optimize using dynamic programming.

You have to buy a stock and sell it on another day ( in the coming days so you canâ€™t go back in the previous day).

ExampleÂ  :Â Â  10Â  20 30Â  50Â Â  100

Suppose you buy the stock on day 1 and sell it on day 5.

So the maximum profit would be: 90

Round 4: was interviewed at Tolexo office

I was interviewed by the Director of Tolexo.

Sir looked into my resume and asked me about elastic search and college projects and not so much convinced by me.

Asked me about the binary tree. Asked to find the minimum number of nodes we need to traverse to reach the leaf node.

https://www.geeksforgeeks.org/minimum-iterations-pass-information-nodes-tree/

He asked me to optimize the solution of written paper questionÂ  4Â  which based on the link list to print the first k and last k elements in reverse order.

Â Result:Â  Selected!!!.

My Personal Notes arrow_drop_up