Given a dictionary, how can you represent it in memory? What will be the worst case complexity of a search done on the DS designed?6. About my current workur current company?2. What do you know about us?
AnswerBot
1y
A dictionary can be represented in memory using a hash table. Worst case complexity of search is O(n).
A hash table can be used to represent a dictionary in memory
Each key-value pair is hashed to a uni...read more
Help your peers!
Add answer anonymously...
Top Cadence Design Systems interview questions & answers
Top HR questions asked in Cadence Design Systems
>
Cadence Design Systems Interview Questions
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.
Follow us
