Premium Employer

i

This company page is being actively managed by Franklin Templeton Investments Team. If you also belong to the team, you can get access from here

Franklin Templeton Investments Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Franklin Templeton Investments Oracle SQL and PLSQL Developer Interview Questions and Answers

Updated 27 Feb 2024

Franklin Templeton Investments Oracle SQL and PLSQL Developer Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(2 Questions)

  • Q1. Explain about the joins and differences between the inner join and left join
  • Ans. 

    Joins are used to combine rows from two or more tables based on a related column between them.

    • Inner join returns only the rows that have matching values in both tables

    • Left join returns all the rows from the left table and the matched rows from the right table

    • Inner join is more restrictive as it requires a match in both tables, while left join is less restrictive

    • Example: SELECT * FROM table1 INNER JOIN table2 ON table1....

  • Answered by AI
  • Q2. What is your contribution in your current project

Interview Preparation Tips

Interview preparation tips for other job seekers - They have asked questions on the joins.
Data modeling questions and ETL concepts

Skills evaluated in this interview

Interview questions from similar companies

Interview Questionnaire 

11 Questions

  • Q1. Print all nodes at a distance k from a given node in binary tree?
  • Q2. RandN function : which generates random number in [1,2,3..N] with equal probability. Given rand5, write a code for rand7 using rand5
  • Ans. 

    Code for rand7 using rand5 function

    • Use rand5 twice to generate a number in [1,25] with equal probability

    • If the number is greater than 21, discard and try again

    • Otherwise, return (number mod 7) + 1

  • Answered by AI
  • Q3. Puzzle: Using all(8,8,3,3) and only operators(*,/,-,+), make 24
  • Q4. How do you implement LRU cache?
  • Ans. 

    LRU cache is implemented using a doubly linked list and a hash map.

    • Create a doubly linked list to keep track of the order of elements in the cache.

    • Create a hash map to store the key-value pairs of the cache.

    • When a new element is added, check if the cache is full. If it is, remove the least recently used element from the linked list and the hash map.

    • When an element is accessed, move it to the front of the linked list to...

  • Answered by AI
  • Q5. Your current project in Company? A lot of questions from CV? Discussion went on for about 15 minutes?
  • Q6. Then had a lot of questions around java script and java. About different design patterns and web services
  • Q7. A lot of questions around java, collections frameworks, multi threading and so on. (This took a good 25-30 minutes )
  • Q8. A strategy question. It would be asked depending on which team you are being interviewed for.Mine was some apple seller problem. Here knowledge of real world scenario helps. Advice is to observe things aro...
  • Q9. Write down function to select pivot element randomly in Quick Sort
  • Ans. 

    Function to randomly select pivot element in Quick Sort

    • Generate a random index within the range of the array

    • Return the element at the randomly generated index as the pivot

  • Answered by AI
  • Q10. He asked me what is a data structure and why do we use one. Explained him. He asked some real life example of stack and queue. All I could gave him was programming examples but when he insisted on real li...
  • Q11. As we were talking very much on each question. He felt like talking more and from tech he went around for some biggest learning from a mistake/biggest achievement of life kind of questions. There were oth...

Interview Preparation Tips

General Tips: I recently interviewed with Goldman Sachs, and had 4 rounds of interview with them at their campus in Bangalore.
Skills: Algorithm, Data structure
College Name: na

Skills evaluated in this interview

Interview Preparation Tips

Round: Technical Interview
Experience: Technical on paper test questions:(dis was only for 12 among d 26 shortlisted ppl after apti...others directly had interviews)
5 wer selected in this test who wer nw sent for interviews
TECHNICAL INTERVIEW: (pls list the questions asked in all the rounds)
26 shortlisted after apti (14 directly for interviews & 12 had one more technical on paper test...mentioned above)
der wer min 2 technical rounds for each of them...max were 5

- You are given course dependencies
A->B,C
B->D
C->A
D->nothing
The above dependencies mean...if you want to take course A...you should take courses B and C first....To take B,Course D must be taken first....D is an independent course and can be taken without any prior requirements.
Now you are told these dependencies.Come up with an appropriate data structure to represent these dependencies.Then write a code that finds out all the courses that the student can take up...in this case the student can first take course D because its independent.Now that course D has been taken he can next take up B as it depends on B alone...But the courses A and C can never be taken because they depend on each other...So here all the courses that can be taken are B and D.
After i wrote the code....he asked for all possible test cases
-Given an array of length N....It can be filled with nos. only from 1 to N....find which nos are repeated in the array
-Given pointers to two nodes in a binary tree....find their least common ancestor...each node has pointer to only the parent node...not the left and right child..
-In a binary tree(Not necessarily a BST)...suppose the weight of any node is defined as the product of the key value of the node and the level of the node(Root at level 1)...find the node with maximum weight in the binary tree
-A sorted array of size n is right circularly rotated k times and this rotated array is given to you as input...Find out the value of k in log n time .
-There are some processes running at time T....and there are processes running at time T+30.
You have to find out
1)Which processes died at time T+30,which were alive at time T
2)Which are the new processes at time T+30,which were not there at time T
3)Which are the processes that were there at time T and are still running at time T+30
What data structure will you use to represent the process lists and write code to find out the answers to the 3 questions above
-Given a binary search tree...and a target sum...starting at the root...which all paths add up to the target sum?...if there are multiple paths....return the path with least no. of nodes.


College Name: Veermata Jijabai Technological Institute, Mumbai [ VJTI ]

I was interviewed before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

There were 33 questions in total. The objective questions were simple.

  • Q1. 

    Sort Big List Dates Problem Statement

    Mary is an enthusiastic party-goer who struggles with remembering event dates. Help Mary by sorting a given list of event dates in an ascending order.

    Example:

    Inpu...
  • Ans. 

    Sort a list of event dates in ascending order based on year, month, and day.

    • Sort the list of dates based on year, then month, and finally day.

    • Use a sorting algorithm to rearrange the dates in ascending order.

    • Ensure the constraints are met for each date in the list.

  • Answered by AI
  • Q2. 

    Pair Sum Problem Statement

    You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

    Note:
    ...
  • Ans. 

    Given an array and a target sum, find all pairs of elements that add up to the target sum.

    • Iterate through the array and for each element, check if the complement (target sum - current element) exists in a hash set.

    • If the complement exists, add the pair to the result list.

    • Sort the pairs based on the first element and then the second element.

    • Handle edge cases like duplicate elements and pairs with the same values.

    • Example...

  • Answered by AI
  • Q3. 

    Maximum Sum Problem Statement

    Given an integer N, your task is to recursively break it into three integer parts: N / 2, N / 3, and N / 4. You need to compute the maximum sum possible by dividing the numbe...

  • Ans. 

    Given an integer N, recursively break it into three parts and find the maximum sum possible.

    • Recursively divide N into N/2, N/3, and N/4 to find the maximum sum

    • Compare the sum obtained by dividing N with the sum of N itself

    • Return the maximum sum for each test case

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMorgan Stanley interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed before Mar 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round with questions based on DSA.

  • Q1. 

    Duplicate Integer in Array

    Given an array ARR of size N, containing each number between 1 and N-1 at least once, identify the single integer that appears twice.

    Input:

    The first line contains an integer...
  • Ans. 

    Identify the duplicate integer in an array containing numbers between 1 and N-1.

    • Iterate through the array and keep track of the frequency of each element using a hashmap.

    • Return the element with a frequency greater than 1 as the duplicate integer.

    • Ensure the constraints are met and a duplicate number is guaranteed to be present.

  • Answered by AI
  • Q2. 

    Sum Root to Leaf Numbers

    You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...

  • Ans. 

    Calculate the total sum of all root to leaf paths in a binary tree formed by concatenating node values.

    • Traverse the binary tree from root to leaf nodes, keeping track of the current path sum

    • Add the current node value to the path sum and multiply by 10 for each level

    • When reaching a leaf node, add the final path sum to the total sum

    • Return the total sum modulo (10^9 + 7)

  • Answered by AI
  • Q3. 

    Topological Sort Problem Statement

    You are given a directed acyclic graph (DAG). Your task is to perform topological sorting of the graph and return any valid ordering.

    Explanation:

    A directed acyclic g...

  • Ans. 

    Implement a function to perform topological sorting on a directed acyclic graph (DAG) and return any valid ordering.

    • Create a graph data structure to represent the DAG

    • Use depth-first search (DFS) to perform topological sorting

    • Maintain a visited array to keep track of visited nodes

    • Return the ordering of nodes after DFS traversal

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical interview round with questions based on DSA.

  • Q1. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...

  • Ans. 

    Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the LCA.

    • Handle cases where one node is an ancestor of the other.

    • Consider edge cases like when X or Y is the root node.

    • Implement a recursive or iterative solution to find the LCA efficiently.

  • Answered by AI
  • Q2. 

    Rotated Array Minimum Finder

    You are provided with a sorted array that has undergone 'K' rotations (the exact value of 'K' is unknown). A rotation involves shifting each element of the array to the right,...

  • Ans. 

    Implement a function to find the minimum number in a rotated sorted array efficiently.

    • Use binary search to find the minimum element in the rotated array.

    • Compare the mid element with the start and end elements to determine which half of the array to search next.

    • Continue the binary search until the minimum element is found.

  • Answered by AI
  • Q3. 

    Maximum Binary Tree Construction Problem

    Given an array TREE of 'N' unique integers, construct a maximum binary tree using the following rules:

    1. The root of this tree is the maximum number in TREE.
    2. T...
  • Ans. 

    Construct a maximum binary tree from an array of unique integers following specific rules.

    • Find the maximum number in the array to set as the root of the tree.

    • Recursively construct the left subtree with elements before the maximum number.

    • Recursively construct the right subtree with elements after the maximum number.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMorgan Stanley interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Telephonic Call 

Round duration - 60 minutes
Round difficulty - Easy

The interviewer called my via phone and simultaneously provided me a link where I had to write the code for a given problem. It was scheduled at 12:30 pm, so timing was not an issue. It was a standard DP question involving a 2D matrix. The question was easy and I was able to code it within given time.

Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

The interviewer asked me two coding questions in this round.

  • Q1. Write an efficient program to find the sum of the contiguous subarray within a one-dimensional array of numbers that has the largest sum.
  • Ans. 

    Efficient program to find sum of largest contiguous subarray within a one-dimensional array.

    • Use Kadane's algorithm to find the maximum sum subarray in O(n) time complexity.

    • Initialize max_sum and current_sum to 0, iterate through array updating current_sum and max_sum.

    • Return max_sum as the result.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

This was on-site round at their Bangalore office. The interviewer was friendly and helpful. The interview held inside a conference room.

  • Q1. 

    DFS Traversal Problem Statement

    Given an undirected and disconnected graph G(V, E), where V is the number of vertices and E is the number of edges, the connections between vertices are provided in the 'GR...

  • Ans. 

    DFS traversal problem to find connected components in an undirected and disconnected graph.

    • Use Depth First Search (DFS) algorithm to traverse the graph and find connected components

    • Maintain a visited array to keep track of visited vertices

    • Iterate through all vertices and perform DFS on unvisited vertices to find connected components

  • Answered by AI
Round 4 - Face to Face 

Round duration - 60 minutes
Round difficulty - Easy

This was the next round of the onsite interviews. Took place in the same conference room as that of the previous round.

Round 5 - Face to Face 

Round duration - 60 minutes
Round difficulty - Easy

This was the third round of the onsite interview. 
 

Interview Preparation Tips

Professional and academic backgroundI completed Software Engineering from Netaji Subhas University Of Technology. I applied for the job as SDE - 1 in BangaloreGoldman Sachs interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Database, System Design, Operating SystemsTime required to prepare for the interview - 6 MonthsInterview preparation tips for other job seekers

Practice DP based questions as much as you can. Also, be confident during the interview about your solution. For practice, you can prefer Coding Ninjas and Geeks For Geeks.

Application resume tips for other job seekers

Keep it short. Mention the academic and professional projects you've done. Add your educational details properly with percentage or CGPA obtained.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: The first round was an online test with maths, logic and english questions. If you have prepared for any of the standardised tests (GMAT, GRE, CAT etc.), the test would be pretty simple. And try to answer as many questions as possible.
Tips: It would be really helpful if you give atleast your first attempt to any of the exams like GMAT, GRE etc. This is only for the online test because the pattern is quite similar to GMAT. For the interviews, be prepared for a set of standard questions asked during interviews that you can easily find online.

General Tips: Be prepared to spend all day at the interviews. You might not even get a lunch break. Sometimes the interview calls are late at night and also extend upto 2-3am. Be alert during the Pre-placement talk because the interviewers ask you questions from that too. I would advice you to ask questions to the interviewer when asked to regarding the company.
Don't write fake stuff in resume. At max you can exaggerate a bit in your CV. The panel does question you on your CV. Everything in it must be justified.
Skills:
College Name: NIT Surathkal

I was interviewed before Dec 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 87 minutes
Round difficulty - Medium

Timing : It was conducted in evening at 3 PM
The pacreception environment was very user friendly .
The platform was audio and video proctored.

  • Q1. 

    Binary to Decimal Conversion

    Convert a given binary number, represented as a string 'S' of size 'N', into its decimal equivalent integer and output it.

    Input:

    The first line contains an integer 'T', den...
  • Ans. 

    Convert a binary string to its decimal equivalent integer.

    • Iterate through the binary string from right to left, multiplying each digit by 2 raised to the power of its position.

    • Add the results of the multiplication to get the decimal equivalent.

    • Ensure the binary string consists only of '0' and '1' characters.

    • Handle multiple test cases by repeating the conversion process for each case.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 80 minutes
Round difficulty - Medium

So This was a very interactive round . There were two interviewers , one male and one female . The male interviewer was quite experienced where as female interviewer was relatively new . The Interview started by a small introduction followed by some OOPS related questions where I was tested on how i perceive the concept of OOPS in real life . Then this conversation was followed by some core concepts of JAVA like abstract classes and interfaces . Then I was asked about my projects that i mentioned in my resume , then after some healthy discussion on those projects , the interviewer started to question about DBMS , I was asked some basic queries followed by some advanced queries and then followed by a discussion on SQL vs NoSQL . Then Interviewers asked me about my tech stack and the source of my technical knowledge. Then at last I was asked that why Blackrock and this concluded my Interview.

  • Q1. 

    Ninja And The Triangle Problem Statement

    Ninja is provided with 'N' stars and the task is to construct a triangle such that the 'i'th level of the triangle uses 'i' number of stars. The goal is to make th...

  • Ans. 

    Given 'N' stars, construct a triangle with maximum height using 'i' stars in 'i'th level.

    • Calculate the maximum height of the triangle using the formula: height = floor((-1 + sqrt(1 + 8 * N)) / 2)

    • Iterate through each test case and calculate the maximum height for each 'N'.

    • Output the maximum height for each test case.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from TIET - Thapar Institute of Engineering And Technology. I applied for the job as SDE - 1 in MumbaiEligibility criteriaAbove 7 CGPABlackrock interview preparation:Topics to prepare for the interview - Data Structures , Algorithms , Operation Systems , OOPS , DBMS , Web DevelopmentTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Be precise about what to do and what not to do.
Tip 2 : Always Revise the concepts you have done in past , use prime day revision theory.
Tip 3 : Do as many projects as you can but always mention those projects in which you are very well versed.
Tip 4 : Keep on reading random news related to your favourite tech and always have an in depth knowledge of what tech you currently use.

Application resume tips for other job seekers

Tip 1 : Keep it short , precise and effective .
Tip 2 : Mention even small things that you did had an impact on other people.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Concurrency problem
  • Ans. 

    Concurrency problem occurs when multiple threads access shared resources simultaneously, leading to unexpected behavior.

    • Use synchronization mechanisms like locks, semaphores, or monitors to control access to shared resources.

    • Avoid race conditions by ensuring that critical sections of code are executed atomically.

    • Consider using thread-safe data structures or immutable objects to minimize the risk of concurrency issues.

  • Answered by AI

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in Apr 2024. There was 1 interview round.

Round 1 - HR 

(2 Questions)

  • Q1. Explain more about yourself
  • Q2. Could you walk me through your last project?

Franklin Templeton Investments Interview FAQs

How many rounds are there in Franklin Templeton Investments Oracle SQL and PLSQL Developer interview?
Franklin Templeton Investments interview process usually has 1 rounds. The most common rounds in the Franklin Templeton Investments interview process are One-on-one Round.

Tell us how to improve this page.

Franklin Templeton Investments Oracle SQL and PLSQL Developer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more
Join Franklin Templeton Investments Join us and say hello to progress. Yours and ours.

Interview Questions from Similar Companies

Goldman Sachs Interview Questions
3.5
 • 376 Interviews
Morgan Stanley Interview Questions
3.7
 • 291 Interviews
Morningstar Interview Questions
3.9
 • 241 Interviews
FactSet Interview Questions
3.9
 • 205 Interviews
Apex Group Interview Questions
2.7
 • 133 Interviews
Kotak Securities Interview Questions
3.6
 • 116 Interviews
Blackrock Interview Questions
3.8
 • 99 Interviews
Mr Cooper Interview Questions
4.0
 • 81 Interviews
View all
Senior Analyst
180 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Analyst
164 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Assistant Manager
134 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
109 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Treasury Analyst
85 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Franklin Templeton Investments with

Blackrock

3.8
Compare

Vanguard

4.1
Compare

Fidelity Investments

4.2
Compare

State Street Global Advisors

3.8
Compare
Did you find this page helpful?
Yes No
write
Share an Interview